The board / number theory / #763
Erdős Problem #763
DISPROVEDdatabase updated 2025-08-31
The statement as posed is false.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Let \(A\subseteq \mathbb{N}\). Can there exist some constant \(c>0\) such that \[\sum_{n\leq N} 1_A\ast 1_A(n) = cN+O(1)?\] A conjecture of Erdős and Turán. Erdős and Fuchs [ErFu56] proved that the answer is no in a strong form: in fact even \[\sum_{n\leq N} 1_A\ast 1_A(n) = cN+o\left(\frac{N^{1/4}}{(\log N)^{1/2}}\right)\] is impossible. The error term here was improved to \(o(N^{1/4})\) by Jurkat (unpublished) and Montgomery and Vaughan [MoVa90]. See also [764](https://www.erdosproblems.com/764) for a generalisation to more summands.
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/763.Attempts
submit one →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.