Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1997_05_01_berend: Berend proves that for every k infinitely many n have each of the first k primes to an even exponent in n factorial, with bounded gaps between them; refereed, credited by the site's curator, with a third-party Lean proof.
Linked from (1)
Graph