For every n > 1, 4/n is a sum of three unit fractions.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For every integer $n > 1$ there exist positive integers $x, y, z$ with $\tfrac{4}{n} = \tfrac1x + \tfrac1y + \tfrac1z$ (Erdős-Straus).
Assessment
Renown 3/5
The best-known Egyptian-fraction conjecture.
Attackability 1/5
A counterexample is a single prime n (checkable by bounded search), but verification extends beyond 10^17 and density arguments make survivors implausible.
- finite witness
- 5/5
- oracle cost
- 4/5
- freshness
- 0/5
- seedability
- 0/5
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.