The board / number theory / #125
Erdős Problem #125
DISPROVED LEANdatabase updated 2026-03-30
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 the set of integers which have only the digits \(0, 1\) when written base 3, -/ local notation "A" => { x : ℕ | (digits 3 x).toFinset ⊆ {0, 1} } /-- and \(B\) be the set of integers which have only the digits \(0, 1\) when written base 4. -/ local notation "B" => { x : ℕ | (digits 4 x).toFinset ⊆ {0, 1} } /- There are four possibilities for the density of \(A+B\): 1. \(A+B\) has zero upper and lower density (and hence also zero density). 2. \(A+B\) has zero lower density, but positive upper density (and hence no density). 3. \(A+B\) has positive upper and lower density that are equal (and hence positive density). 4. \(A+B\) has positive upper and lower density that are unequal (and hence no density). -/ /-- Case 3: Does \(A + B\) have positive upper and lower density that are equal? This is the literal interpretation of "positive density" which was falsified.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 5 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/125.Prizenone
Statement in LeanFormal Conjectures
Solution in Leanyes
OEISA367090
Original pageerdosproblems.com/125
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.