Skip to content

Erdős Problem #46

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

Colour all integers from 2 onward using finitely many colours. Must there always be a finite collection of distinct denominators of one colour whose reciprocals sum to exactly one?

That is Erdős Problem #46, an Egyptian-fraction Ramsey question. The answer is yes, proved by Ernest Croot in 2003.

A small example

The distinct denominators 2, 3 and 6 give

\[ \frac12+\frac13+\frac16=1. \]

If these integers are all assigned the same colour, they already form the required representation. But arbitrary colourings can separate them, so this observation is not a proof of the general theorem.

What is known

Croot, On a coloring conjecture about unit fractions, Annals of Mathematics 157 (2003), 545–556, proved a stronger finite-interval statement: for any number \(r\) of colours, a sufficiently large interval of denominators beginning at 2 forces a monochromatic unit-fraction representation of one. Restricting an arbitrary colouring of all positive integers to that interval gives the result immediately.

The registry also reports a generalization concerning monochromatic representations of other positive rational numbers. That extension has additional distinct-denominator bookkeeping and should not be substituted for the primary one-sum theorem without checking its construction.

GCL's current state

Source audit #1315 checks the finite-interval implication, distinctness requirement and finite arithmetic example. The admitted frozen GCL formal-provider snapshot has no #46 statement. Reported external Lean status does not establish a protected GCL theorem certificate.

What remains

The existence question is settled. Future work may formalize Croot's theorem or its rational-target corollaries, with full source and axiom verification, but should not call the original question open.

Sources and claim boundaries

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1315 — 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.

Back to catalogue · Compendium introduction