Skip to content

Erdős Problem #242

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: falsifiable (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 Erdős–Straus conjecture asks whether every integer \(n>2\) admits three distinct positive denominators \(x<y<z\) satisfying

\[ \frac4n=\frac1x+\frac1y+\frac1z. \]

This is an exact rational identity, not a decimal approximation. The strict order \(x<y<z\) is part of the catalogue's statement; allowing repeated denominators changes the formulation.

A small example

For \(n=5\), the denominators \(2,5,10\) give

\[ \frac45=\frac12+\frac15+\frac1{10}. \]

A finite search can select \(x\) and \(y\), solve algebraically for \(z\), then demand a positive integer satisfying \(z>y\). All identities should be checked by integer cross multiplication. A negative, fractional or repeated denominator is not a valid witness.

What is known

OPEN. The maintained Erdős #242, updated May 2026, reports computational verification for all \(n\le10^{18}\) (Mihăilescu–Du 2025). Even this enormous finite range is not a proof for all positive integers. It suffices to prove the conjecture for prime denominators \(n\), but infinitely many primes remain.

Obláth and Mordell established numerous congruence families with solutions; Mordell reduced possible exceptions to six residue classes modulo 840. Vaughan proved exceptional integers are sparse; Elsholtz–Tao investigated numbers of representations. None of these results eliminates every possible exception.

The pinned descriptor FALSIFIABLE does not mean a counterexample has been found. The mathematical conjecture is still open and no certified counterexample was identified.

GCL's current state

Pinned status: FALSIFIABLE; maintained mathematical status: OPEN. Original source issue #1511. No universal proof, independent formal certification or verified counterexample is claimed.

The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.

What remains

A bounded successor searches every integer \(3\le n\le500\), returns exact ordered triples, and checks all identities without floating-point arithmetic. Acceptance: every reported witness has distinct positive denominators and equality under cross multiplication; finite success must be labelled finite verification only. The actual research obligation remains the infinite family of uncovered prime cases.

Sources and claim boundaries

No new global proof, falsification or protected editorial admission is asserted.

Catalogue and evidence provenance

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

Back to catalogue · Compendium introduction