Egyptian Fractions Calculator
Solve egyptian fractions problems step-by-step with our free calculator. See formulas, worked examples, and clear explanations.
Calculator
Adjust values & calculateStep-by-Step Decomposition
Formula
Where n/d is a proper fraction decomposed into a sum of distinct unit fractions 1/a1, 1/a2, etc. The greedy algorithm finds each unit fraction by computing ceiling(d/n) to get the largest possible unit fraction not exceeding the remaining value.
Last reviewed: December 2025
Worked Examples
Example 1: Decomposing 3/7 into Egyptian Fractions
Example 2: Decomposing 5/8 for Fair Division
Background & Theory
The Egyptian Fractions Calculator applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Egyptian Fractions Calculator traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Key Features
- Solves linear, quadratic, and higher-degree polynomial equations step by step, returning all real and complex roots with full working shown.
- Simplifies fractions to lowest terms and computes ratios and proportions, including cross-multiplication checks and equivalent fraction generation.
- Performs complete prime factorization of any integer and computes the Greatest Common Divisor and Least Common Multiple for sets of numbers.
- Handles matrix operations including addition, scalar multiplication, matrix multiplication, determinant calculation, and full matrix inversion for square matrices.
- Evaluates all standard trigonometric functions and their inverses in degrees or radians, and verifies common trigonometric identities symbolically.
- Calculates permutations, combinations, and binomial coefficients for combinatorics problems, supporting both formula display and step-by-step breakdown.
- Converts integers between binary, octal, decimal, and hexadecimal bases instantly, with optional display of the positional value expansion.
- Computes the sum of arithmetic and geometric sequences given the first term, common difference or ratio, and number of terms, with formula derivation.
Frequently Asked Questions
Formula
n/d = 1/a1 + 1/a2 + ... + 1/ak (where a1 < a2 < ... < ak)
Where n/d is a proper fraction decomposed into a sum of distinct unit fractions 1/a1, 1/a2, etc. The greedy algorithm finds each unit fraction by computing ceiling(d/n) to get the largest possible unit fraction not exceeding the remaining value.
Worked Examples
Example 1: Decomposing 3/7 into Egyptian Fractions
Problem: Express 3/7 as a sum of distinct unit fractions using the greedy algorithm.
Solution: Step 1: ceiling(7/3) = 3, so first unit fraction is 1/3\n3/7 - 1/3 = (9 - 7)/21 = 2/21\n\nStep 2: ceiling(21/2) = 11, so next unit fraction is 1/11\n2/21 - 1/11 = (22 - 21)/231 = 1/231\n\nStep 3: 1/231 is already a unit fraction\n\nResult: 3/7 = 1/3 + 1/11 + 1/231\nVerification: 1/3 + 1/11 + 1/231 = 77/231 + 21/231 + 1/231 = 99/231 = 3/7
Result: 3/7 = 1/3 + 1/11 + 1/231
Example 2: Decomposing 5/8 for Fair Division
Problem: Express 5/8 as Egyptian fractions to divide 5 items among 8 people.
Solution: Step 1: ceiling(8/5) = 2, so first unit fraction is 1/2\n5/8 - 1/2 = (5 - 4)/8 = 1/8\n\nStep 2: 1/8 is already a unit fraction\n\nResult: 5/8 = 1/2 + 1/8\nPractical meaning: Each person gets 1/2 of an item plus 1/8 of an item\nVerification: 1/2 + 1/8 = 4/8 + 1/8 = 5/8
Result: 5/8 = 1/2 + 1/8 (each person gets half plus one-eighth)
Frequently Asked Questions
What are Egyptian fractions and where do they come from?
Egyptian fractions are a way of representing rational numbers as sums of distinct unit fractions, where each unit fraction has 1 as its numerator. This notation originated in ancient Egypt around 1650 BCE, as documented in the Rhind Mathematical Papyrus and the Egyptian Mathematical Leather Roll. The ancient Egyptians used this system for all their fractional calculations, with the sole exception of 2/3 which had its own special symbol. For example, they would write 3/4 as 1/2 + 1/4 rather than using the single fraction 3/4. This system persisted for over 2,000 years in Egyptian mathematics and influenced Greek and medieval European mathematical traditions as well.
How does the greedy algorithm for Egyptian fractions work?
The greedy algorithm, also known as the Fibonacci-Sylvester algorithm, works by always choosing the largest possible unit fraction at each step. Given a fraction n/d, find the smallest integer k such that 1/k is less than or equal to n/d (k = ceiling of d/n). Subtract 1/k from n/d to get a new, smaller fraction, and repeat. For example, for 3/7: ceiling(7/3) = 3, so take 1/3. Then 3/7 - 1/3 = 2/21. Ceiling(21/2) = 11, so take 1/11. Then 2/21 - 1/11 = 1/231. The result is 3/7 = 1/3 + 1/11 + 1/231. This algorithm always terminates because the numerator strictly decreases at each step, guaranteeing convergence to zero.
Why did ancient Egyptians use unit fractions instead of regular fractions?
Historians believe the Egyptians preferred unit fractions for practical and conceptual reasons. Unit fractions are intuitive for fair division: 1/3 means one part out of three equal parts. The Egyptians may have found it easier to conceptualize sharing as taking successive unit portions rather than working with abstract numerators greater than one. Their hieroglyphic notation also made unit fractions simple to write: an eye symbol (or mouth symbol) was placed over the denominator. Additionally, comparison between fractions is straightforward with unit fractions since 1/n is always greater than 1/m when n is less than m. Some scholars also argue the system was a deliberate mathematical choice that enabled efficient computation.
Is the Egyptian fraction representation of a number unique?
No, Egyptian fraction representations are not unique. Most fractions can be decomposed into unit fractions in multiple ways. For example, 2/3 can be written as 1/2 + 1/6, or as 1/3 + 1/4 + 1/12, or even as 1/3 + 1/5 + 1/9 + 1/45. Different algorithms produce different decompositions. The greedy algorithm tends to produce fewer terms but can result in very large denominators. Other methods, like the splitting identity (1/n = 1/(n+1) + 1/(n(n+1))), can be used to generate alternative representations. The Erdos-Straus conjecture, one of the famous unsolved problems in mathematics, asks whether every fraction 4/n can be written as a sum of exactly three unit fractions.
What is the Erdos-Straus conjecture about Egyptian fractions?
The Erdos-Straus conjecture, proposed in 1948 by Paul Erdos and Ernst Straus, states that for every integer n greater than or equal to 2, the fraction 4/n can be expressed as a sum of exactly three unit fractions: 4/n = 1/a + 1/b + 1/c, where a, b, and c are positive integers. Despite being verified computationally for all n up to 10^14, no general proof has been found. The conjecture has been proven for many special cases, including all n that are not congruent to 1 modulo 24. It remains one of the most famous open problems in number theory. A proof would have implications for understanding the structure of rational number decompositions and additive number theory.
How do you add and compare Egyptian fractions?
Adding Egyptian fractions is done by finding a common denominator for all unit fractions in the sum and combining them. For example, 1/2 + 1/3 + 1/6: the common denominator is 6, giving 3/6 + 2/6 + 1/6 = 6/6 = 1. Comparing two Egyptian fraction representations involves computing each sum and comparing the results. If you want to compare 1/3 + 1/5 with 1/2 + 1/12, compute each: 1/3 + 1/5 = 8/15 and 1/2 + 1/12 = 7/12. Converting to a common denominator: 8/15 = 32/60 and 7/12 = 35/60, so 1/2 + 1/12 is larger. The computational cost can grow quickly because denominators in Egyptian fractions can become very large.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy