Egyptian Fractions Calculator
Calculate the Egyptian fraction decomposition, simplified fraction, decimal value, and term count from a numerator and denominator. Egyptian Fractions Calculator helps students, teachers, and mathematicians explore unit-fraction representations.
Highlights
- Decompose proper fractions into distinct Egyptian unit fractions.
- Simplify fractions to their lowest terms automatically.
- View accurate decimal equivalents for easy comparison.
- Count the unit fractions in each Egyptian fraction representation.
- Identify the largest denominator in the decomposition.
Table of Contents
How Egyptian Fractions Calculator Works?
The calculator represents a proper fraction as a sum of distinct unit fractions, where every unit fraction has a numerator of 1. For an input fraction a/b, with 1 ≤ a < b, the standard greedy method selects the smallest unit fraction that does not exceed the remaining value. Its denominator is q = ⌈b/a⌉, and the selected term is 1/q.
The process repeats on the remaining fraction until the remainder is zero. Because each newly selected denominator is larger than the previous one, the resulting unit fractions are distinct. For example, 3/7 becomes 1/3 + 1/11 + 1/231. The calculator also reduces the original fraction using the greatest common divisor, calculates its decimal value, counts the unit-fraction terms, and reports the largest denominator used.| Output | Calculation or meaning |
|---|---|
| Egyptian Fraction | Sum of distinct fractions whose numerators are all 1 |
| Simplified Fraction | a/g over b/g, where g = gcd(a, b) |
| Decimal Value | a ÷ b |
| Unit Fraction Count | Number of unit-fraction terms in the decomposition |
| Largest Denominator | Greatest denominator among the calculated unit fractions |
Practical Use Cases
Students can enter fractions such as 3/7 to see how a familiar fraction is decomposed into unit fractions and to connect division, greatest common divisors, and fraction addition.
Teachers can use the calculator to create classroom examples showing the greedy Egyptian-fraction algorithm, verify that the unit fractions recombine to the original value, and compare the number and size of terms produced.
Mathematics enthusiasts can investigate how different numerator-and-denominator pairs produce distinct decompositions, including the effect of simplifying the input before interpreting its decimal value and term count.
Researchers and problem solvers can quickly inspect the largest denominator and number of terms generated by the standard greedy representation for proper fractions within the calculator's supported integer ranges.
Accuracy and Limitations
The simplified fraction and Egyptian-fraction decomposition are based on integer arithmetic, so they are exact for valid integer inputs within the supported ranges: numerator 1–999999 and denominator 2–1000000, with the denominator greater than the numerator. The decimal output is a numerical approximation when its exact value is repeating. The greedy decomposition is a valid representation with distinct unit fractions, but it is not guaranteed to use the fewest possible terms or the smallest possible largest denominator. Improper, zero, negative, non-integer, or out-of-range inputs are not supported.
Quick Examples
Example #1: Simple Unit Fraction
Decompose a basic proper fraction that is already an Egyptian unit fraction.
Example #2: Classic Egyptian Fraction
Represent two-sevenths as a sum of distinct unit fractions.
Example #3: Multi-Term Decomposition
Explore the decomposition of a larger proper fraction into several Egyptian unit fractions.
