The board / number theory / #292
Erdős Problem #292
PROVEDdatabase updated 2025-08-31
The statement as posed is true, and a proof exists.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
The set \(A\) of \(n\in \mathbb{N}\) such that there exist \(1\leq m_1<\cdots <m_k=n\) with \(\sum\tfrac{1}{m_i}=1\).
Let \(A\) be the set of \(n\in \mathbb{N}\) such that there exist \(1\leq m_1<\cdots <m_k=n\) with \(\sum\tfrac{1}{m_i}=1\). Explore \(A\). In particular, does \(A\) have density \(1\)? Straus observed that \(A\) is closed under multiplication. Furthermore, it is easy to see that \(A\) does not contain any prime power. The answer is yes, as proved by Martin [Ma00], who in fact proved that if \(B=\mathbb{N}\backslash A\) then, for all large \(x\), \[\frac{\lvert B\cap [1,x]\rvert}{x}\asymp \frac{\log\log x}{\log x},\] and also gave an essentially complete description of \(B\) as those integers which are small multiples of prime powers. van Doorn has observed that if \(n\in A\) (with \(n>1\)) then \(2n\in A\) also, since if \(\sum \frac{1}{m_i}=1\) then \(\frac{1}{2}+\sum\frac{1}{2m_i}=1\) also.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 4 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/292.Prizenone
Topicsnumber theory, unit fractions
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA092671
Original pageerdosproblems.com/292
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.