Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_02_05_price: Price's argument of 5 February 2026, generated with GPT-5.2 Pro, shows that for every epsilon some bounded r gives the integers 2^k + n, n with at most r prime factors, lower density at least 1 - epsilon; confirmed by Tao.
Linked from (1)
Graph