Dual View Random Solved Random Open
PROVED This has been solved in the affirmative.
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].

View the LaTeX source

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)
Related OEIS sequences: Possible
Likes this problem None
Interested in collaborating None
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #806, https://www.erdosproblems.com/806, accessed 2026-01-16