Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2021_01_20_wang: Wang proves that, under the Elliott–Halberstam conjecture for friable integers, the n with P(n) below P(n+1) have asymptotic density one half; refereed, conditional, so it settles no standing.
2026_09_24_openai: The OpenAI release claims independent Dickman limit laws for the largest prime factors of n and n plus one and deduces that the n with P(n) below P(n+1) have natural density one half; its Lean proof of the corollary was built and audited by this corpus, so accepted.
Linked from (1)
Graph