Erdős Problem a Daythe open tracker

Erdős Problem #806

PROVEDdatabase updated 2025-08-31

The statement as posed is true, and a proof exists.

What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).

Let \(A\subseteq \{1,\ldots,n\}\) with \(\lvert A\rvert \leq n^{1/2}\). Must there exist some \(B\subset\mathbb{Z}\) with \(\lvert B\rvert=o(n^{1/2})\) such that \(A\subseteq B+B\)? A problem of Erdős and Newman [ErNe77], who proved that there exist \(A\) with \(\lvert A\rvert\asymp n^{1/2}\) such that if \(A\subseteq B+B\) then \[\lvert B\rvert \gg \frac{\log\log n}{\log n}n^{1/2}.\] Resolved by Alon, Bukh, and Sudakov [ABS09], who proved that for any \(A\subseteq \{1,\ldots,n\}\) with \(\lvert A\rvert \leq n^{1/2}\) there exists some \(B\) such that \(A\subseteq B+B\) and \[\lvert B\rvert \ll \frac{\log\log n}{\log n}n^{1/2}.\] See also [333](https://www.erdosproblems.com/333).
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 2 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/806.
Prizenone
Topicsadditive combinatorics
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/806
NOBODY HAS SENT US AN ATTEMPT YET

If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.