EGYPTIAN FRACTION EXPANSIONS FOR RATIONAL NUMBERS BETWEEN 0 AND 1 OBTAINED WITH ENGEL SERIES
ELVIA NIDIA GONZALEZ´ AND JULIA BERGNER, PHD DEPARTMENT OF MATHEMATICS
Abstract. The ancient Egyptians expressed rational numbers as the finite sum of distinct unit fractions. Were the Egyptians limited by this notation? In fact, they were not as every rational number can be written as a finite sum of distinct unit fractions. Moreover, these expansions are not unique. There exist several di↵erent algorithms for computing Egyptian fraction expansions, all of which produce di↵erent representations of the same rational number. One such algorithm, called an Engel series, produces a finite increasing sequence of integers for every rational number. This sequence is then used to obtain an Egyptian fraction expansion. Motivated by the work of M. Mays, this project aims to investigate properties of natural number denominators n that produce x length x Egyptian fraction expansions using Engel series for n between 0 and 1. x While computing Engel expansions using Mathematica, a helpful pattern emerged: rational numbers n which produce length x Egyptian fraction expansions were those whose denominator minus one was divisible by every natural number between (and including) x and 2. We conjecture and prove that this will always x hold for length x Engel series for between 0 and 1 where n = k lcm(x, x 1,...,3, 2) + 1 for k N. n · 2 Furthermore, we conjecture that n = lcm(x, x 1,...,3, 2) + 1 is the smallest n such that x produces a n length x Egyptian fraction expansion. A proof that n = k lcm(x, x 1,...,3, 2) + 1 works is included along · with an investigation of whether or not n = lcm(x, x 1,...,3, 2) + 1 the least such n that does.
1. Introduction The Rhind papyrus is responsible for preserving the mathematical methods employed by the ancient Egyptians. It is clear from this document that the Egyptians had an unintuitive way of expressing rational numbers. Unlike the current precedent, in which one integer is written over another integer, they would write 2 1 1 out rational numbers as a sum of distinct unit fractions. For example, 7 would be written as 4 + 28 instead. Additionally, the Rhind papyrus included extensive tables, one of which included di↵erent representations 2 of n for odd n between 5 and 101 using the following identity [7] 1 1 1 = + . n n +1 n (n + 1) · However impractical these expansions may seem, they make certain real-life problems much easier to solve. One such real-life application is the sharing problem. This problem focuses on sharing whole items (like loaves of bread) with multiple people. For example, how can five loaves be split evenly amongst eight 5 people? The solution can be written as the proper fraction, 8 . This means each person gets five eighths of a loaf. Now, applying this is not as easy as writing out the solution as a fraction. How would someone cut five-eighths from eight loaves? Each loaf could be cut in half, then those halves into quarters, then those quarters into eighths. From here, each of the eight persons would receive five small pieces of bread. This solution, although correct, is not very practical. 5 1 1 If we represent 8 as 2 + 8 , this sharing problem becomes significantly easier to put into practice. Each person receives half a loaf first, which ensures that four loaves are distributed evenly amongst all eight people.
Key words and phrases. Egyptian fractions, Engel Series, Number Theory. This work is funded through UC LEADS at the University of California, Berkeley. 1 2 ELVIA NIDIA GONZALEZ´ AND JULIA BERGNER, PHD DEPARTMENT OF MATHEMATICS
Next, the final loaf can be cut into eighths and each person would receive one of those pieces. Along with being easier to distribute the bread, this solution allows each person to have one larger piece (the half loaf) along with the smaller piece (the eighth loaf). These representations inspired many questions. Some have been answered. For example, we know that Egyptian fraction expansions are not unique. Di↵erent algorithms may produce di↵erent representations 5 1 1 1 of the same fraction. Our example of 8 can also be expressed as 2 + 10 + 40 . Table 1 lists several more examples.
Table 1. Expansions of various rational numbers using di↵erent algorithms.
x n Engel Series Greedy Algorithm Continued Fraction
5 1 1 1 1 1 1 1 1 1 1 7 2 + 6 + 24 + 168 2 + 5 + 70 2 + 6 + 21
4 1 1 1 1 1 1 1 1 1 1 1 13 4 + 20 + 140 + 1820 4 + 18 + 468 4 + 28 + 70 + 130
7 1 1 1 1 1 1 1 1 18 3 + 18 3 + 18 3 + 24 + 104 + 234
Another question that arose from Egyptian fraction expansions inquired whether or not the Egyptians were limited by the use of this notation. That is, could they express any rational number as a sum of distinct unit fraction? The Egyptians, as it turns out, were not at all limited. Any rational number can be expressed as the finite sum of distinct unity fractions. Furthermore, even irrational numbers can be expressed as an infinite sum of distinct unit fractions. The focus of this project is Egyptian fraction expansions for rational numbers between 0 and 1 (but not including 0 and 1) obtained using an Engel series. Some examples of these expansions can be seen on the second column of Table 1.
2. Engel Expansions An Engel series, for any real number, is sequence of increasing integers [6]. Any real number, say z, can be expressed as an Egyptian fraction expansion using an Engel series in a unique way. This representation for any real z can be computed by defining u = z then letting a = 1 .From here, each subsequent a 1 1 u1 i+1 d e 1 and ui+1 is obtained by first computing ui+1 = ui ai 1 then computing ai+1 = ,where is the · d ui e de ceiling function defined as r = s if and only if s 1