Why it matters
It is an elementary-looking Diophantine problem that mixes congruences, constructive identities, and large-scale computation.
Context and known approaches
Many congruence classes admit direct identities, and enormous ranges have been checked, but a proof covering every n is unknown.
Formal boundary
For every n≥2, find positive integers x,y,z such that 4/n = 1/x + 1/y + 1/z.
Known partial results
Pending review. No structured partial-result note has been added to this dossier.
Source trail
- Wikipedia — History, identities, and computational evidence.
- Wikipedia open-problems list — Composite index by mathematical field.
- Wikipedia list subsection — Placement in the accepted revision-pinned living-list snapshot.