Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1998_01_01_ruzsa: Theorem 2 of Ruzsa's 1998 paper proves that every additive complement of the primes has liminf of its counting function over log N at least e^gamma, about 1.781, answering the third question yes; accepted on the refereed publication.
Linked from (1)
Graph