Papalocal
Loading…
Papalocal · Things
Work

Erdős–Straus conjecture

Erdős–Straus conjecture is an unproven statement in number theory.

All 4 facts, and where they come from

Facts

4 facts · 0 confirmed by two sources · 0 cited · 4 from one source

What it is
conjecture One source
mathematical concept One source
Named after
Paul Erdős One source
Ernst G. Straus One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2567918816
Described as
unproven statement in number theory
What it is
conjecture; mathematical concept
Named after
Paul Erdős; Ernst G. Straus
Wikipedias with a page
19

Wikidata item Q1349651 (wikidata.org/wiki/Q1349651), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1383447838

The Erdős–Straus conjecture is an unproven statement in number theory. The conjecture is that, for every integer n that is greater than or equal to 2, there exist positive integers x, y, and z for which 4n=1x+1y+1z.In other words, the number 4/n can be written as a sum of three positive unit fractions.
The conjecture is named after Paul Erdős and Ernst G. Straus, who formulated it in 1948, but it is connected to much more ancient mathematics; sums of unit fractions, like the one in this problem, are known as Egyptian fractions, because of their use in ancient Egyptian mathematics. The Erdős–Straus conjecture is one of many conjectures by Erdős, and one of many unsolved problems in mathematics concerning Diophantine equations.
Although a solution is not known for all values of n, infinitely many values in certain infinite arithmetic progressions have simple formulas for their solution, and skipping these known values can speed up searches for counterexamples. Additionally, these searches need only consider values of n that are prime numbers, because any composite counterexample would have a smaller counterexample among its prime factors. Computer searches have verified the truth of the conjecture up to n≤1017.
If the conjecture is reframed to allow negative unit fractions, then it is known to be true. Generalizations of the conjecture to fractions with numerator 5 or larger have also been studied.

From the Wikipedia article “Erdős–Straus conjecture” (en.wikipedia.org/wiki/Erdős–Straus_conjecture), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it