Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1989_09_01_balog: Balog's 1989 theorem that every large n is a sum of two integers with no prime factor above n^(4/(9 sqrt e)+epsilon), the exponent 0.2695..., so f(n) is at most n^(1/3) as Erdős asked; refereed, the best function f open.
Linked from (1)
Graph