Egyptian Fractions

Two thousand years before Christ, the Babylonians used decimals (sexagesimals, actually) to represent fractions. The Babylonian base 60 system was handy for representing many different fractions since 60 divides 2, 3, 4, 5, and 6, among other numbers (see also shortcuts for checking for divisibility). The Egyptians, on the other hand, had a clumsier system for expressing fractions. While they understood rational fractions with numerators greater than one, they had no symbols for them. With the exception of ⅔ (two-thirds), for which the Egyptians had a special symbol (literally "one over one and a half"), they had symbols only for unit fractions (fractions that are the reciprocals of natural numbers. Examples of unit fractions are ½, ⅓, ⅕, ¹/_192,754, and so on.

To work with non unit fractions, the Egyptians expressed such fractions as sums of distinct unit fractions. So, ¾ would be represented as ½ + ¼. This can become cumbersome, so the Ancient Egyptians used tables. For example, the Rhind papyrus contains a table in which every fraction of the form ²/_b is expressed as a sum of distinct unit fractions, where b is an odd integer between 5 and 101.

Interestingly, although the Egyptian system is much more complicated than the Babylonian system, or our modern system of having fractions with any numerator and denominator (which the ancient Chinese were able to handle), the ancient Greeks adopted the Egyptian system. Note that the Ionic number system isn't able to gracefully handle anything except for unit fractions. As a matter of fact, this system survived in Europe until the 17th century.

An interesting mathematical recreation is to determine the "best" representation of a fraction in Egyptian fractions. There are several meanings of "best". For example, it could mean minimizing the number of terms, or minimizing the largest denominator, or minimizing the sum of the denominators, or some other criteria. It is obvious that any proper fraction can be expressed as the sum of unit fractions if a repetition of terms is allowed. For example, ³/₇ = ¹/₇ + ¹/₇ + ¹/₇. This isn't allowed in Egyptian fractions; all of the fractions in an expansion must have different denominators.

A famous algorithm for writing any proper fraction as the sum of a finite number of distinct Egyptian fractions was first published in 1202 by Fibonacci in his book Liber Abaci. This algorithm, which is a "greedy algorithm", is fairly simple. Find the largest unit fraction not greater than the proper fraction that you want to find an expansion for. Subtract that unit fraction from the fraction to obtain another proper fraction. The second term of the expansion is the largest unit fraction not greater than that proper fraction. Continue until you obtain a remainder that is a unit fraction. This algorithm always works, and always generates a series of Egyptian fractions containing a number of terms no greater than the value of the numerator.

This algorithm doesn't always generate the "best" expansion, however. For example, the sequence generated by ²/₂₁ is ¹/₁₁ + ¹/₂₃₁. A "nicer" expansion, though, is ¹/₁₅ + ¹/₃₅. To deal with fractions of the form ²/_xy, with x not equal to y, the formula ²/_xy = ¹/_(x((x+y)/2)) + ¹/_(y((x+y)/2)) can be used.

One interesting unsolved problem is: Can a proper fraction ⁴/_b always be expressed as the sum of three or fewer unit fractions? This conjecture has been verified to extremely large values of b, but has not been proved.