What Is an Egyptian Fraction?
An Egyptian fraction expresses a positive rational number as a sum of distinct unit fractions — fractions whose numerator is 1, such as \(\frac{1}{2}\), \(\frac{1}{3}\) or \(\frac{1}{7}\). The ancient Egyptians wrote all fractions this way (except for a special symbol for \(\frac{2}{3}\)). This calculator converts any proper fraction you enter into such a sum automatically.
How to Use the Calculator
Enter the numerator and denominator of a proper fraction (numerator smaller than denominator). The calculator first reduces the fraction to lowest terms, then applies the greedy algorithm and shows the full expansion plus how many unit fractions it contains.
The Formula Explained
The greedy method, attributed to Fibonacci and Sylvester, repeatedly removes the largest possible unit fraction. For a remainder \(\frac{a}{b}\), the next denominator is \(d = \left\lceil \frac{b}{a} \right\rceil\). Subtracting \(\frac{1}{d}\) gives a new fraction \(\frac{a \cdot d - b}{b \cdot d}\), which is reduced and processed again. Because the numerator strictly decreases at each step, the process always terminates.
$$\frac{\text{Numerator } a}{\text{Denominator } b} = \frac{1}{d_1} + \frac{1}{d_2} + \cdots + \frac{1}{d_k}, \qquad d_i = \left\lceil \frac{b}{a} \right\rceil$$
Worked Example
Take \(\frac{5}{6}\). Here \(d = \left\lceil \frac{6}{5} \right\rceil = 2\), so we take \(\frac{1}{2}\). The remainder is $$\frac{5}{6} - \frac{1}{2} = \frac{2}{6} = \frac{1}{3}.$$ That is already a unit fraction, so the expansion is \(\frac{1}{2} + \frac{1}{3}\), using 2 unit fractions. You can verify: $$\frac{1}{2} + \frac{1}{3} = \frac{3}{6} + \frac{2}{6} = \frac{5}{6}. \checkmark$$
More Worked Examples
Each step uses the greedy rule: for the current fraction \(\frac{a}{b}\), take \(d=\lceil b/a\rceil\), subtract \(\frac{1}{d}\), reduce the remainder to lowest terms, and repeat until the numerator is 1.
Example 1: 2/3
- \(\lceil 3/2\rceil = 2\), so the first term is \(\frac{1}{2}\).
- Remainder: \(\frac{2}{3}-\frac{1}{2}=\frac{4-3}{6}=\frac{1}{6}\). The numerator is 1, so we stop.
Result: \(\frac{2}{3}=\frac{1}{2}+\frac{1}{6}\).
Example 2: 4/13
- \(\lceil 13/4\rceil=\lceil 3.25\rceil=4\), so the first term is \(\frac{1}{4}\). Remainder: \(\frac{4}{13}-\frac{1}{4}=\frac{16-13}{52}=\frac{3}{52}\).
- \(\lceil 52/3\rceil=\lceil 17.33\rceil=18\), so the second term is \(\frac{1}{18}\). Remainder: \(\frac{3}{52}-\frac{1}{18}=\frac{54-52}{936}=\frac{2}{936}=\frac{1}{468}\) after reducing by 2.
- The numerator is 1, so the third term is \(\frac{1}{468}\).
Result: \(\frac{4}{13}=\frac{1}{4}+\frac{1}{18}+\frac{1}{468}\).
Check with common denominator 468: \(\frac{117}{468}+\frac{26}{468}+\frac{1}{468}=\frac{144}{468}=\frac{4}{13}\), since \(468=13\times 36\) and \(4\times 36=144\).
Example 3: 7/15
- \(\lceil 15/7\rceil=\lceil 2.14\rceil=3\), so the first term is \(\frac{1}{3}\). Remainder: \(\frac{7}{15}-\frac{1}{3}=\frac{7-5}{15}=\frac{2}{15}\).
- \(\lceil 15/2\rceil=8\), so the second term is \(\frac{1}{8}\). Remainder: \(\frac{2}{15}-\frac{1}{8}=\frac{16-15}{120}=\frac{1}{120}\).
- The numerator is 1, so the third term is \(\frac{1}{120}\).
Result: \(\frac{7}{15}=\frac{1}{3}+\frac{1}{8}+\frac{1}{120}\). Note that \(\frac{1}{3}+\frac{1}{5}=\frac{8}{15}\), which is not \(\frac{7}{15}\), so two terms are not enough here.
Check with denominator 120: \(\frac{40}{120}+\frac{15}{120}+\frac{1}{120}=\frac{56}{120}=\frac{7}{15}\) (divide by 8).
Greedy Expansions of Common Fractions Compared
| Fraction | Greedy expansion | Terms | Largest denominator |
|---|---|---|---|
| 2/3 | 1/2 + 1/6 | 2 | 6 |
| 3/4 | 1/2 + 1/4 | 2 | 4 |
| 5/6 | 1/2 + 1/3 | 2 | 3 |
| 7/15 | 1/3 + 1/8 + 1/120 | 3 | 120 |
| 4/13 | 1/4 + 1/18 + 1/468 | 3 | 468 |
| 4/17 | 1/5 + 1/29 + 1/1233 + 1/3039345 | 4 | 3,039,345 |
| 5/121 | 1/25 + 1/757 + 1/763309 + 1/873960180913 + a final term of about 1.5×1024 | 5 | about 1.5×1024 (25 digits) |
Greedy is not always the best. The algorithm always terminates with distinct unit fractions, but it can produce very large denominators and does not guarantee the fewest terms. Two examples:
- \(\frac{4}{17}=\frac{1}{5}+\frac{1}{34}+\frac{1}{170}\) has three terms and a largest denominator of 170, compared with four terms and 3,039,345 from greedy. Check: \(\frac{34}{170}+\frac{5}{170}+\frac{1}{170}\) does not apply directly; use \(\frac{1}{5}+\frac{6}{170}=\frac{34}{170}+\frac{6}{170}=\frac{40}{170}=\frac{4}{17}\).
- \(\frac{5}{121}=\frac{1}{33}+\frac{1}{121}+\frac{1}{363}\) has three terms and a largest denominator of 363. Check: \(\frac{11}{363}+\frac{3}{363}+\frac{1}{363}=\frac{15}{363}=\frac{5}{121}\).
Egyptian fraction representations are not unique, so the calculator's greedy output is one valid answer, not the only one.
Key Terms
- Unit fraction
- A fraction whose numerator is 1, such as \(\frac{1}{7}\).
- Proper fraction
- A fraction whose numerator is smaller than its denominator, so its value is between 0 and 1. Egyptian fraction expansion is usually applied to these.
- Lowest terms (GCD reduction)
- A fraction is in lowest terms when the numerator and denominator share no common factor other than 1. Divide both by their greatest common divisor (GCD) to reduce it, for example \(\frac{2}{936}=\frac{1}{468}\).
- Ceiling function
- \(\lceil x\rceil\) is the smallest integer greater than or equal to \(x\). For example, \(\lceil 3.25\rceil=4\) and \(\lceil 5\rceil=5\).
- Greedy (Fibonacci-Sylvester) algorithm
- A method that repeatedly subtracts the largest unit fraction not exceeding the current fraction, namely \(\frac{1}{\lceil b/a\rceil}\), until the remainder is itself a unit fraction. It always terminates.
- Distinct denominators
- In an Egyptian fraction, no unit fraction is repeated, so every denominator is different. This is why \(\frac{2}{5}\) is not written as \(\frac{1}{5}+\frac{1}{5}\).
FAQ
Are Egyptian fraction expansions unique? No. A fraction can be written as unit fractions in many ways; the greedy algorithm produces just one valid representation.
Why must the fractions be distinct? By definition Egyptian fractions use different denominators, which is what makes the greedy approach interesting rather than simply writing \(\frac{1}{b}\) repeatedly.
Can the denominators get very large? Yes. The greedy method can produce surprisingly large denominators even for simple fractions, which is one of its known drawbacks.