Erdős Problem a Daythe open tracker

Erdős Problem #871

DISPROVED LEANdatabase updated 2026-01-05

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\) be an additive basis of order \(2\), and suppose \(1_A\ast 1_A(n)\to \infty\) as \(n\to \infty\). Can \(A\) be partitioned into two disjoint additive bases of order \(2\)? A question of Erdős and Nathanson [ErNa88], who proved this is true if \(1_A\ast 1_A(n) > c\log n\) (for all large \(n\)) for some constant \(c>(\log\frac{4}{3})^{-1}\). Erdős and Nathanson [ErNa89] also proved that for every \(t\) there exists a basis \(A\) of order \(2\) such that \(1_A\ast 1_A(n)\geq t\) for all large \(n\) and yet \(A\) cannot be partitioned into two disjoint additive bases. This has been disproved by Larsen using Claude Opus 4.5 - in fact only a small modification of the argument of [ErNa89] is required.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/871.
Prizenone
Topicsnumber theory, additive basis
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/871
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.