Erdős Problem #45
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, unit fractions, ramsey theory.
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
Write a positive integer as a sum of unit fractions, such as \(1/2+1/3+1/6=1\). Erdős Problem #45 asks whether, for every number of colours \(k\ge2\), there is one integer \(n_k\) such that every colouring of its nontrivial proper divisors into \(k\) colours contains a monochromatic collection with reciprocal sum exactly one.
The mathematical answer is yes, following from a theorem of Ernest Croot. The integer \(n_k\) must be chosen before seeing the colouring.
A small example
For \(n_k=12\), the nontrivial proper divisors are \(2,3,4,6\). If 2, 3 and 6 happen to share a colour, then
This verifies one colour configuration, not every possible colouring; the full theorem requires a special sufficiently large integer chosen as a function of \(k\).
What is known
Croot, On a coloring conjecture about unit fractions, Annals of Mathematics 157 (2003), 545–556, proved that for any colouring of a suitable finite interval of denominators \([2,b^k]\), one colour contains distinct denominators whose reciprocals sum to one. Choose \(n_k\) divisible by every integer in that interval, and large enough that each is a proper divisor. Any colouring of the appropriate divisors restricts to a colouring of the interval, giving #45.
The maintained registry reports a doubly exponential scale for the optimal \(n_k\), with lower estimates discussed by Mehtaab Sawhney. Those sharper estimates have not been independently reconstructed here.
GCL's current state
GCL source audit #1314 checks the source theorem, precise proper-divisor convention and the finite lcm transfer. The public registry reports external Lean work. The admitted frozen GCL formal-provider snapshot has no #45 statement, and no deep theorem proof has been GCL kernel-replayed.
What remains
Nothing remains to settle the existence question. Formalizing the exact interval-to-divisor reduction and verifying a cited external proof are separate documentary or certification tasks, not a new solution.
Sources and claim boundaries
- Erdős Problems #45: solved question and bound discussion.
- Croot (2003), publisher article: primary source of colouring theorem.
- GCL source return #1314: exact lcm transfer and source limits, not proof certification.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1314 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.