Egyptian Fraction Calculator

About Egyptian Fraction Calculator

Welcome to the Egyptian Fraction Calculator, an interactive tool that expresses any proper fraction as a sum of distinct unit fractions — the way ancient Egyptian scribes represented every non-trivial fraction nearly four thousand years ago. Type a numerator and denominator, and watch the tool run three classical algorithms side-by-side, animate a pie-slice convergence, and reveal whether your fraction appears in the famous Rhind Mathematical Papyrus (c. 1650 BC).

What Is an Egyptian Fraction?

An Egyptian fraction is a finite sum of distinct unit fractions — fractions of the form \( \frac{1}{k} \) where \(k\) is a positive integer. For example:

Ancient Egyptians wrote every fraction this way, using a special hieroglyph — a dotted oval (𓂉) placed above an integer to indicate its reciprocal. The only non-unit fraction they used was 2/3, which had its own dedicated symbol. Remarkably, the Rhind Mathematical Papyrus (c. 1650 BC) opens with a table decomposing every \( \frac{2}{n} \) for odd \(n\) from 5 to 101 — one of the oldest mathematical tables ever compiled.

The Greedy Algorithm (Fibonacci-Sylvester)

The simplest and most famous method for computing an Egyptian fraction expansion is the greedy algorithm, first described by Fibonacci in his Liber Abaci (1202) and later re-analyzed by J. J. Sylvester in 1880. At each step, subtract the largest unit fraction that does not exceed the remainder:

This process is guaranteed to terminate. The key observation is that the new numerator \( n \cdot k - d \) is strictly less than the old numerator \(n\), because \(k\) is the smallest integer at least as large as \(d/n\). A strictly decreasing positive integer sequence cannot continue forever — hence the algorithm always halts. This is Fibonacci's theorem: every positive rational has a finite Egyptian-fraction representation.

How to Use This Calculator

1. Enter the fraction: Type a positive integer numerator and a positive integer denominator. The numerator must be less than the denominator.
2. Run the computation: Click "Compute Egyptian Fraction" to run all three algorithms.
3. Watch the pie animation: The pie slices add up one at a time, converging toward the target fraction (marked by the dashed ring).
4. Compare algorithms: See how the greedy, binary, and practical methods differ in term count, maximum denominator, and historical style.
5. Review the step-by-step proof: Each row shows the current remainder, the chosen unit fraction, and the new remainder — so you can verify the expansion by hand.

Why Did Egyptians Use Unit Fractions?

Unit fractions were deeply practical for Egyptian arithmetic. Consider the problem from the Rhind Papyrus: divide 5 loaves of bread equally among 8 workers. The modern answer is 5/8 of a loaf each, but how do you physically cut 5/8 of a loaf? The Egyptian decomposition gives:

Now the solution is trivial: cut 4 loaves in half (giving 8 half-loaves, one to each worker) and cut the 5th loaf into 8 pieces (one eighth to each). Every worker receives exactly 1/2 + 1/8 = 5/8 of a loaf. The unit-fraction expansion is the physical algorithm for equitable division.

Multiple Algorithms Compared

1. Greedy Algorithm (Fibonacci-Sylvester, 1202)

Always picks the largest possible unit fraction at each step. Produces a canonical expansion, but denominators can grow rapidly. For \( \frac{5}{121} \) the greedy method gives \( \frac{1}{25} + \frac{1}{757} + \frac{1}{763309} + \ldots \) — astronomically large denominators from a small input.

2. Binary Method (Erdős-inspired)

Exploits the identity \( \frac{n}{d} = \frac{n/2}{d/2} \) when both are even, and uses the splitting \( \frac{2}{2k+1} = \frac{1}{k+1} + \frac{1}{(k+1)(2k+1)} \) for odd denominators. Often produces cleaner expansions for fractions whose denominator has small factors.

3. Practical Method (Rhind-style)

Combines short-offset searches with known Rhind Papyrus decompositions. For the famous table entries (2/3, 2/5, 2/7, ...) it returns the exact decomposition Egyptian scribes used three millennia ago.

The Rhind Papyrus 2/n Table

The opening of the Rhind Mathematical Papyrus (c. 1650 BC) lists Egyptian-fraction expansions for every \( \frac{2}{n} \) with \(n\) odd, from 5 to 101. These are the earliest known mathematical tables. A sample:

Egyptian scribes consistently preferred short expansions with even denominators, a stylistic rule whose precise algorithm modern mathematicians still debate.

Open Problems & Modern Research

Egyptian fractions remain an active area of research. A few celebrated open questions:

• Erdős-Straus conjecture (1948): For every integer \(n \ge 2\), the fraction \( \frac{4}{n} \) can be written as a sum of three unit fractions. Verified computationally up to \(n = 10^{17}\); unproven in general.
• Sierpiński conjecture (1956): Every \( \frac{5}{n} \) (for \(n \ge 2\)) admits a three-term Egyptian expansion. Still open.
• Unit-fraction chromatic number: For a given numerator \(a\), does every \( \frac{a}{n} \) decompose into at most \(f(a)\) unit fractions?

Historical Timeline

• c. 1650 BC: The Rhind Mathematical Papyrus (copied by the scribe Ahmes from an older original) presents the 2/n table — the oldest known mathematical reference work.
• c. 850 BC: The Moscow Mathematical Papyrus applies Egyptian fractions to volumes of truncated pyramids and distribution of beer rations.
• c. 300 AD: Diophantus uses Egyptian fractions in his Arithmetica.
• 1202 AD: Fibonacci's Liber Abaci formalizes the greedy algorithm as a systematic method.
• 1880: J. J. Sylvester gives a modern proof of termination.
• 1948: Erdős & Straus pose the still-unsolved 4/n conjecture.
• Modern era: Algorithmic work continues — including methods by Tenenbaum, Graham, and others, producing ever-shorter and smaller-denominator expansions.

Fun Facts About Egyptian Fractions

• The hieroglyph for "part" (Egyptian: r) drawn above a number denoted its reciprocal — so \( \frac{1}{7} \) was literally written as "part seven".
• Egyptians had special symbols for 1/2, 1/3, 1/4 (called the "natural fractions") separate from the general reciprocal system.
• The fraction 2/3 — the only non-unit fraction with its own symbol — was considered so fundamental that even 1/3 was sometimes computed as "half of 2/3".
• The Eye of Horus symbol (𓂀) combines six unit fractions: \( \frac{1}{2} + \frac{1}{4} + \frac{1}{8} + \frac{1}{16} + \frac{1}{32} + \frac{1}{64} = \frac{63}{64} \) — deliberately leaving 1/64 short as a mythological reference to the lost piece.

Frequently Asked Questions

What is an Egyptian fraction?

An Egyptian fraction is a sum of distinct unit fractions — fractions with numerator 1 — such as \( \frac{1}{2} + \frac{1}{3} + \frac{1}{15} \). Ancient Egyptians expressed every fraction this way, with the single exception of 2/3, which had its own symbol.

How does the greedy (Fibonacci-Sylvester) algorithm work?

At each step, subtract the largest unit fraction \( \frac{1}{k} \) that does not exceed the current remainder, where \(k = \lceil d/n \rceil\). Repeat with the new remainder until it reaches zero. The algorithm is guaranteed to terminate for any proper fraction.

Is the Egyptian fraction expansion unique?

No. Every proper fraction has infinitely many Egyptian-fraction representations. The greedy algorithm gives one canonical answer, but other algorithms can produce shorter, smaller-denominator, or historically-authentic expansions. That's why our tool runs three algorithms side-by-side.

What was the Rhind Mathematical Papyrus?

The Rhind Papyrus, dated around 1650 BC, is the largest surviving Egyptian mathematical text. It opens with a table decomposing every \( \frac{2}{n} \) (for odd \(n\) from 5 to 101) into distinct unit fractions — the oldest known systematic mathematical table.

Why did Egyptians only use unit fractions?

Egyptian arithmetic was built around division and doubling. Unit fractions matched their practical need to divide goods among people — splitting 5 loaves among 8 workers becomes 1/2 + 1/8 each, a calculation that can be physically demonstrated by cutting.

Does every positive rational have an Egyptian fraction representation?

Yes. It is a theorem of Fibonacci (1202) that every positive rational number can be written as a finite sum of distinct unit fractions. The proof is the greedy algorithm itself — each step reduces the numerator, so the process must terminate.

Why are the denominators sometimes huge?

The greedy algorithm tends to produce expansions with rapidly growing denominators. For example, \( \frac{5}{121} \) via greedy produces a denominator exceeding a trillion. This is why Egyptian scribes preferred their own table of short decompositions rather than a mechanical algorithm.

Additional Resources

• Egyptian Fraction - Wikipedia
• Rhind Mathematical Papyrus - Wikipedia
• Greedy Algorithm for Egyptian Fractions - Wikipedia
• Erdős-Straus Conjecture - Wikipedia
• OEIS: Egyptian fraction expansions

Related MiniWebtools:

Fraction Calculators:

• Comparing Fractions Calculator
• Decimal to Fraction Calculator
• Equivalent Fractions Calculator
• Fraction Calculator
• Fraction Simplifier
• Fraction to Decimal Calculator
• Fraction to Mixed Number Converter
• Fraction to Percent Converter
• Mixed Number to Fraction Converter
• Reduce Fractions Calculator
• Multiple Fraction Calculator New
• Number to Fraction Converter New
• Egyptian Fraction Calculator New