Erdős Problem a Daythe open tracker

Erdős Problem #337

DISPROVED LEANdatabase updated 2025-12-10

The statement as posed is false. 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 \(A\subseteq \mathbb{N}\) be an additive basis (of any finite order) such that \(\lvert A\cap \{1,\ldots,N\}\rvert=o(N)\). Is it true that \[ \lim_{N\to \infty}\frac{\lvert (A+A)\cap \{1,\ldots,N\}\rvert} {\lvert A\cap \{1,\ldots,N\}\rvert}=\infty? \] The answer is no, and a counterexample was provided by Turjányi [Tu84]. This was generalised (to the replacement of \(A+A\) by the \(h\)-fold sumset \(hA\) for any \(h\geq 2\)) by Ruzsa and Turjányi [RT85]. "Additive basis" is `Set.IsAsymptoticAddBasis`: some finite \(h\) has \(hA\) containing every sufficiently large integer. The exact notion `Set.IsAddBasis`, which asks that \(hA\) be all of \(\mathbb{N}\), would force \(0, 1 \in A\) and is not the class these results are about. The linked file states the basis hypothesis as `∃ N₀, Set.Ici N₀ ⊆ iterated_sumset A k` and indexes both counting functions by a real \(x\) through \(\lfloor x\rfloor\), where the counting functions here are indexed by \(N : \mathbb{N}\).
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 3 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/337.
Prizenone
Topicsnumber theory, additive combinatorics, additive basis
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/337
NOBODY HAS SENT US AN ATTEMPT YET

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.