Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_01_03_tao: Tao proves the factors-at-most-n asymptotic by a modified approximate-factorization argument; pairing the factors, as Cambie observed, answers the n squared question; PNT+ formalizes both upper bounds in Lean.
Linked from (1)
Graph