The board / number theory / #310
Erdős Problem #310
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 \(\alpha >0\) and \(N\geq 1\). Is it true that for any \(A\subseteq \{1,\ldots,N\}\) with \(\lvert A\rvert \geq \alpha N\) there exists some \(S\subseteq A\) such that \[\frac{a}{b}=\sum_{n\in S}\frac{1}{n}\] with \(a\leq b =O_\alpha(1)\)? Liu and Sawhney [LiSa24] observed that the main result of Bloom [Bl21] implies a positive solution to this conjecture. They prove a more precise version, that if \((\log N)^{-1/7+o(1)}\leq \alpha \leq 1/2\) then there is some \(S\subseteq A\) such that \(\frac{a}{b}=\sum_{n\in S}\frac{1}{n}\) with \(a\leq b \leq \exp(O(1/\alpha))\). They also observe that the dependence \(b\leq \exp(O(1/\alpha))\) is sharp.
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/310.Prizenone
Topicsnumber theory, unit fractions
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/310
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.