Erdős Problem #47
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, unit fractions.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
The reciprocal sum of a finite set \(A\) is the sum of \(1/a\) over its positive elements. Erdős Problem #47 asks whether, for each fixed \(\delta>0\), every sufficiently large \(N\) and every \(A\subseteq[1,N]\) satisfying
must contain a subset \(S\) whose reciprocal sum is exactly one. The answer is yes, proved in published mathematical work.
A small example
For \(A=\{2,3,6\}\), the reciprocal sum is one and the entire set is a suitable witness. For \(N=6\) this sum exceeds \(\frac12\log6\). One finite witness gives no information about every qualifying set for arbitrarily large \(N\).
What is known
Thomas Bloom, On a density conjecture about unit fractions (2021), proved a sufficient reciprocal-sum threshold of smaller order than \(\log N\). Yang Liu and Mehtaab Sawhney, On further questions regarding unit fractions (2024), improved it further to a bound on the scale \((\log N)^{4/5+o(1)}\).
For each fixed positive \(\delta\), those thresholds are eventually smaller than \(\delta\log N\). Hence the stronger published results imply the original Erdős assertion. The deep source papers establish the required combinatorial number-theory estimates; the comparison between thresholds is elementary only given their precise hypotheses.
GCL's current state
Source audit #1316 checked the strict reciprocal inequality, quantifier requiring all sufficiently large \(N\), exact target and frozen formal-provider statement. The frozen research theorem still has an unfilled body even though it references an external Lean formalization. No internal deep-proof or axiom replay was performed.
What remains
The historical threshold question is resolved. Further opportunities concern sharper sufficient thresholds and verified formal imports, without treating a finite Egyptian-fraction identity as an asymptotic proof.
Sources and claim boundaries
- Erdős Problems #47: original question and reported improved bounds.
- Bloom (2021), author source and Liu–Sawhney (2024).
- GCL source return #1316: exact statement and threshold comparison, not MathCert.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1316 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.