Dual View Random Solved Random Open
OPEN This is open, and cannot be resolved with a finite computation.
Let $A\subset\mathbb{N}$ be such that every large integer can be written as $n^2+a$ for some $a\in A$ and $n\geq 0$. What is the smallest possible value of\[\limsup \frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N^{1/2}}?\]Is\[\liminf \frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N^{1/2}}>1?\]
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
Such a set $A$ is called an additive complement of the set of squares. Erdős observed that there exist $A$ for which the $\limsup$ is finite and $>1$. Moser [Mo65] proved that, for any such $A$,\[\liminf \frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N^{1/2}}>1.06.\]The best-known lower bound is\[\liminf \frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N^{1/2}}\geq\frac{4}{\pi}\approx 1.273\]proved by Cilleruelo [Ci93], Habsieger [Ha95], and Balasubramanian and Ramana [BaRa01].

The problem of minimising the $\limsup$ appears to have been much less studied. van Doorn has a construction of such an $A$ in which, for all $N$,\[\frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N^{1/2}}< 2\phi^{5/2}\approx 6.66,\]where $\phi=\frac{1+\sqrt{5}}{2}$ is the golden ratio.

View the LaTeX source

This page was last edited 27 December 2025.

External data from the database - you can help update this
Formalised statement? Yes
Likes this problem Woett
Interested in collaborating Woett
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None

Additional thanks to: Timothy Gowers and Wouter van Doorn

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 #33, https://www.erdosproblems.com/33, accessed 2026-01-16