The board / number theory / #35
Erdős Problem #35
PROVED LEANdatabase updated 2026-08-24
The statement as posed is true, and a proof exists. A solution has also been checked by machine, in Lean.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Let \(B\subseteq\mathbb{N}\) be an additive basis of order \(k\) with \(0\in B\). Is it true that for every \(A\subseteq\mathbb{N}\) we have \[d_s(A+B)\geq \alpha+\frac{\alpha(1-\alpha)}{k},\] where \(\alpha=d_s(A)\) and \[d_s(A) = \inf \frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N}\] is the Schnirelmann density? Erdős [Er36c] proved this is true with \(k\) replaced by \(2k\) in the denominator (in a stronger form that only considers \(A\cup (A+b)\) for some \(b\in B\), see [38](https://www.erdosproblems.com/38)). Ruzsa has observed that this follows immediately from the stronger fact proved by Plünnecke [Pl70] that (under the same assumptions, and for \(\alpha>0\)) \[d_S(A+B)\geq \alpha^{1-1/k}.\]
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 1 further variant / known partial result in the Lean file. The authoritative wording is on erdosproblems.com/35.Prizenone
Topicsnumber theory, additive basis
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/35
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.