Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1972_02_01_vaughan: Vaughan (1972) proves that no set has its three-fold representation count equal to cN plus o(N^{1/4} (log N)^{-1/2}) with c > 0, so a bounded error is impossible and the answer is no; accepted, refereed and credited by the site.
Linked from (1)
Graph