The board / number theory / #1096
Erdős Problem #1096
PROVED LEANdatabase updated 2026-08-23
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 \(1<q<1+\epsilon\) and consider the set of numbers of the shape \(\sum_{i\in S}q^i\) (for all finite \(S\)), ordered by size as \(0=x_1<x_2<\cdots\). Is it true that, provided \(\epsilon>0\) is sufficiently small, \(x_{k+1}-x_k \to 0\)? This was solved affirmatively by Erdős and Komornik [ErKo98], who proved the conclusion whenever \(1<q<\sqrt{q_1}\), where \(q_1\) is the second Pisot-Vijayaraghavan number.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/1096.Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/1096
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.