Erdős Problem #1054
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, divisors.
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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
List the positive divisors of an integer \(m\) in increasing order. Add the first \(k\) of them, starting at \(1\). For a given number \(n\), let \(f(n)\) be the smallest \(m\) for which this sum equals \(n\), if one exists.
Erdős Problem #1054 asks whether \(f(n)\) becomes small relative to \(n\): might \(f(n)=o(n)\), perhaps only for almost all \(n\), and could the ratios \(f(n)/n\) nevertheless be arbitrarily large? These are different assertions. The function is undefined at \(n=2\) and \(n=5\), so its domain convention also matters.
A small example
The divisors of \(m=4\) are \(1,2,4\). Their sum is \(1+2+4=7\), so \(f(7)\le4\). In fact the smaller integers \(m=1,2,3\) do not provide a divisor prefix summing to \(7\), so \(f(7)=4\).
Similarly \(m=15\) has smallest divisors \(1,3,5\), which sum to \(9\), and \(m=12\) has prefix \(1,2,3,4\) summing to \(10\). We checked the smallest witnesses for these and other small values by enumerating all \(m\le1000\).
Why is \(n=2\) impossible? The first divisor is \(1\), and adding any second divisor contributes at least \(2\), producing at least \(3\). For \(n=5\), two divisors would have to be \(1,4\), but any integer divisible by \(4\) also has divisor \(2\). Three or more divisors have prefix sum at least \(1+2+3=6\). This gives elementary universal exclusions.
What is known
The maintained catalogue reports that the universal \(f(n)=o(n)\) conjecture has been refuted by an argument of Terence Tao, published in discussion of related Problem #468. Its stated upper-density bound for the set where \(f(n)\le\delta n\) prevents an unrestricted little-o conclusion.
A separate June 2026 discussion proposes a resolution of the remaining unbounded-limsup question, using substantial analytic input. A posted solution or Lean file with explicit unproved external assumptions does not establish independent mathematical certification. The catalogue continues to label #1054 open. The original formulation is attributed to Guy's Unsolved Problems in Number Theory, problem B2.
GCL's current state
Authenticated source audit #2325 verifies elementary divisor-prefix examples and checks the frozen Lean transcription.
The frozen definition returns the sentinel value zero when \(f(n)\) is undefined; it contains proofs of the exclusions at \(2\) and \(5\), but its overall asymptotic variants remain unproved. Notably, one Lean theorem named as if it concerned \(3\) actually asserts the case \(5\). GCL records this naming discrepancy rather than silently treating it as a mathematical theorem change.
What remains
Compare the three historical questions with the exact proof of Tao's density bound and review the June 2026 proposed argument, including any externally assumed analytic lemmas. Establish a precise formal convention for undefined values. These questions are documentary and mathematical source-fidelity obligations, not something finite enumeration can settle.
Sources and claim boundaries
- Erdős Problem #1054, maintained problem, status and historical notes.
- Discussion of #1054, later claimed solution, not independently certified.
- Related Erdős Problem #468, Tao's reported density obstruction.
- Frozen formal-conjectures statement.
- Authenticated GCL source audit #2325 and finite verification script: limited source and arithmetic review, not protected admission.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2325 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- 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.