Decompose fractions into sums of distinct unit fractions with greedy-method steps, improper-fraction handling, term visuals, and exact checks.
<p>The <strong>Egyptian Fraction Calculator</strong> rewrites a fraction as a sum of distinct unit fractions such as 1/2, 1/6, or 1/42. This style of representation goes back to ancient Egyptian mathematics, where fractions were commonly written as sums of reciprocals of positive integers. Today, Egyptian fractions still appear in number theory, proof exercises, mathematical history, and enrichment activities that explore how many different ways a rational number can be represented.</p> <p>This calculator uses the standard greedy method: at each step, it chooses the largest possible unit fraction that does not exceed the remaining fraction, subtracts it, simplifies the remainder, and repeats. That produces a transparent step-by-step decomposition table rather than only a final symbolic answer.</p> <p>It can also handle improper fractions by extracting the whole-number part first, which makes the remaining work a proper-fraction decomposition. The output includes term counts, largest and smallest unit fractions, decimal verification, and a visual comparison of term sizes so you can see how the sum is built piece by piece.</p>
Egyptian-fraction decomposition is easy to get lost in by hand because every step creates a new subtraction and a new simplification problem. This calculator automates the bookkeeping while still exposing the greedy logic, so you can learn the method, verify classwork, or explore how different fractions break into distinct unit terms.
For a proper fraction n/d, choose the next term as 1/ceil(d/n), subtract it from n/d, simplify the remainder, and repeat until the remainder is zero.
Result: 5/6 = 1/2 + 1/3
The largest unit fraction not greater than 5/6 is 1/2. Subtracting leaves 1/3, which is already a unit fraction, so the decomposition is 1/2 + 1/3.
Ancient Egyptian scribes developed a system that represented most fractions as sums of unit fractions. That historical approach is still studied because it connects arithmetic, number theory, and the history of mathematical notation.
The greedy method always takes the largest unit fraction possible at each step. It is systematic, easy to automate, and guaranteed to finish for positive rational numbers, which makes it a natural classroom algorithm.
Egyptian fractions are not just about splitting a value into any small pieces. The unit fractions are distinct, which forces the decomposition to be more structured and often more interesting than an ordinary sum of equal parts.
An Egyptian fraction writes a positive rational number as a sum of distinct unit fractions, where each unit fraction has numerator 1. Use this as a practical reminder before finalizing the result.
It repeatedly chooses the largest unit fraction that does not exceed the remaining fraction, subtracts it, simplifies the remainder, and continues. Keep this note short and outcome-focused for reuse.
Yes. Every positive rational number can be written as a sum of distinct unit fractions.
Yes. The greedy method gives one standard decomposition, but other valid decompositions may also exist.
Egyptian-fraction decompositions are normally built for proper remainders. Pulling out the whole part first keeps the remaining decomposition cleaner.
Each subtraction can leave a smaller remainder that requires a finer unit fraction, so later terms often have much larger denominators than earlier ones. Apply this check where your workflow is most sensitive.