OPEN
This is open, and cannot be resolved with a finite computation.
Let $A\subseteq \mathbb{N}$. Let $B\subseteq \mathbb{N}$ be the set of integers which are representable in exactly one way as the sum of two elements from $A$.
Is it true that for all $\epsilon>0$ and large $N$\[\lvert \{1,\ldots,N\}\backslash B\rvert \gg_\epsilon N^{1/2-\epsilon}?\]Is it possible that\[\lvert \{1,\ldots,N\}\backslash B\rvert =o(N^{1/2})?\]
Apparently originally considered by Erdős and Nathanson, although later Erdős attributes this to Erdős, Sárközy, and Szemerédi (but gives no reference), and claims a construction of an $A$ such that for all $\epsilon>0$ and all large $N$\[\lvert \{1,\ldots,N\}\backslash B\rvert \ll_\epsilon N^{1/2+\epsilon},\]and yet there for all $\epsilon>0$ there exist infinitely many $N$ where\[\lvert \{1,\ldots,N\}\backslash B\rvert \gg_\epsilon N^{1/3-\epsilon}.\]Erdös and Freud investigated the finite analogue in
[ErFr91], proving that there exists $A\subseteq \{1,\ldots,N\}$ such that the number of integers not representable in exactly one way as the sum of two elements from $A$ is $<2^{3/2}N^{1/2}$, and suggest the constant $2^{3/2}$ is perhaps best possible.
View the LaTeX source
This page was last edited 14 September 2025.
Additional thanks to: Boris Alexeev and Zach Hunter
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 #14, https://www.erdosproblems.com/14, accessed 2026-01-16