Egyptian Fractions Calculator – Guide & Formulas
Convert any fraction to Egyptian fractions — a sum of distinct unit fractions. Find the greedy algorithm decomposition with step-by-step explanation.
Convert any fraction to Egyptian fractions — a sum of distinct unit fractions. Enter a fraction to see its greedy algorithm decomposition with step-by-step work.
Key Takeaway
Use the free Egyptian Fractions Calculator to convert any fraction to egyptian fractions — a sum of distinct unit fractions. find the greedy algorithm decomposition with step-by-step explanation. Get instant results with step-by-step explanations.
How to Use the Egyptian Fractions Calculator
- Enter the numerator and denominator of the fraction you want to decompose.
- The calculator applies the greedy algorithm to find distinct unit fractions.
- Review each step showing how the largest possible unit fraction is subtracted.
- See the final Egyptian fraction representation as a sum of unit fractions (1/a + 1/b + ...).
The Formula
Variable Definitions
- a/b: The fraction to decompose into unit fractions
- ⌈b/a⌉: The ceiling of b divided by a — the smallest integer ≥ b/a
- Unit fraction: A fraction with numerator 1 (e.g., 1/2, 1/3, 1/7)
- Greedy algorithm: At each step, choose the largest possible unit fraction
Converting 5/7 to Egyptian Fractions
Decompose 5/7 into a sum of distinct unit fractions using the greedy algorithm.
- Step 1: 5/7 — find largest unit fraction: ⌈7/5⌉ = 2, so 1/2 is first.
- Step 2: Subtract: 5/7 - 1/2 = 10/14 - 7/14 = 3/14.
- Step 3: 3/14 — find largest unit fraction: ⌈14/3⌉ = 5, so 1/5 is next.
- Step 4: Subtract: 3/14 - 1/5 = 15/70 - 14/70 = 1/70.
- Step 5: Result: 5/7 = 1/2 + 1/5 + 1/70. Verify: 35/70 + 14/70 + 1/70 = 50/70 = 5/7. ✓
Frequently Asked Questions
What are Egyptian fractions?
Egyptian fractions are representations of fractions as sums of distinct unit fractions (fractions with numerator 1). The ancient Egyptians used this system exclusively. For example, 2/3 = 1/2 + 1/6.
What is the greedy algorithm for Egyptian fractions?
The greedy algorithm (also called the Fibonacci-Sylvester algorithm) repeatedly finds the largest unit fraction that fits into the current remainder. At each step, take 1/⌈denominator/numerator⌉ and subtract it from the fraction.
Are there always multiple representations?
Yes. Every fraction can be expressed as Egyptian fractions in infinitely many ways. The greedy algorithm gives one specific decomposition, but there are other methods that may produce fewer terms or different representations.
How do I know when the decomposition is complete?
The algorithm terminates when the remaining fraction is itself a unit fraction (numerator = 1). The greedy algorithm is guaranteed to terminate for any positive fraction.
Can improper fractions be converted?
Yes, but first separate the whole number part. For example, 7/3 = 2 + 1/3, and the fractional part 1/3 is already a unit fraction. So 7/3 = 1 + 1 + 1/3 in Egyptian form.
What is the difference between Egyptian and common fractions?
Common fractions allow any numerator (e.g., 3/7). Egyptian fractions require all numerators to be 1 (e.g., 1/3 + 1/11 + 1/231). Egyptian fractions are always sums of distinct unit fractions.
Why were Egyptian fractions important historically?
The ancient Egyptians (c. 1800 BCE) used only unit fractions in their mathematics, as documented in the Rhind Mathematical Papyrus. They had special symbols for 2/3 and used tables to help decompose other fractions.
Can the greedy algorithm produce many terms?
Yes, the greedy algorithm can sometimes produce very large denominators and many terms. For some fractions, alternative methods may give simpler decompositions with fewer or smaller terms.