TOPICS
Search

Egyptian Fraction


An Egyptian fraction is a sum of positive unit fractions, usually required to be distinct. The famous Rhind papyrus, dated to around 1650 BC, contains a table of representations of 2/n as Egyptian fractions for odd n between 5 and 101. The reason the Egyptians chose this method for representing fractions is not clear, although André Weil characterized the decision as "a wrong turn" (Hoffman 1998, pp. 153-154). The unique fraction that the Egyptians did not represent using unit fractions was 2/3 (Wells 1986, p. 29).

Egyptian fractions are almost always required to exclude repeated terms, since representations such as 1/5+1/5+1/5 are trivial. Any positive rational number has representations as an Egyptian fraction with arbitrarily many terms and with arbitrarily large denominators, although for a given fixed number of terms, there are only finitely many. Fibonacci proved that any positive fraction can be represented as a sum of distinct unit fractions (Hoffman 1998, p. 154). An infinite chain of unit fractions can be constructed by repeatedly splitting the term with largest denominator using the identity

 1/a=1/(a+1)+1/(a(a+1))
(1)

for integers a>=2.

Martin (1999) showed that for every positive rational number, there exist Egyptian fractions whose largest denominator is at most N and whose denominators form a positive proportion of the integers up to N for sufficiently large N. Each positive fraction x/y with y odd has an Egyptian fraction in which each denominator is odd (Starke 1952, Breusch 1954; Guy 1994, p. 160). For integers 0<x<y, there is a t-term representation with t=O(sqrt(logy)) as y->infty (Vose 1985).

For a fixed positive rational number x, let R_x(N) be the number of subsets A subset= {1,...,N} with sum_(a in A)1/a=x. Conlon et al. (2025) proved that

 R_x(N)=2^((c_x+o(1))N),
(2)

where

 c_x=int_0^1h(1/(1+e^(lambda_x/t)))dt,
(3)

and h(u)=-ulog_2u-(1-u)log_2(1-u) is the binary Shannon entropy, with h(0)=h(1)=0. The positive parameter lambda_x is the unique solution of

 int_0^1(dt)/(t(1+e^(lambda_x/t)))=x.
(4)

The constant c_x increases strictly with x and tends to 1 as x->infty. In particular, c_1 approx 0.91117. Liu and Sawhney (2024) independently obtained the case x=1. The error term is in the exponent, and the target x is held fixed as N->infty.

Liu and Sawhney (2024) also proved that, for every fixed epsilon>0 and all sufficiently large N, a subset A subset= {1,...,N} with

 sum_(a in A)1/a>=(lnN)^(4/5+epsilon)
(5)

contains a subset whose reciprocals sum to 1. They established the sharp size threshold: |A|>=(1-1/e+epsilon)N also suffices. The constant 1-1/e cannot be decreased, since the integers in {1,...,N} larger than (1/e+delta)N have total reciprocal sum less than 1 for each fixed delta>0 and all sufficiently large N.

Their denominator bound states that every rational number a/b with integers 1<=a<b, for sufficiently large b, has a representation by distinct unit fractions whose largest denominator is at most

 blnb(lnlnb)^3(lnlnlnb)^(O(1)).
(6)

For a related extremal question, let t(N) be the least positive integer t for which 1 has no representation by distinct unit fractions with least denominator t and largest denominator at most N. Liu and Sawhney (2024) showed that

 N/(lnN(lnlnN)^3(lnlnlnN)^(O(1)))<<t(N)<<N/(lnN).
(7)

A minimum number of terms can be found by finite exhaustive search. For a positive remainder r represented by k distinct unit fractions in increasing order of denominators, the first denominator d satisfies [1/r]<=d<=|_k/r_|, where [·] is the ceiling function and |_·_| is the floor function. Recursion therefore gives a finite search for each fixed k; testing successive k eventually finds a shortest representation. The smallest possible largest denominator can likewise be found by enumerating subsets of {1,...,M} for successive M (Eppstein). There are also a number of algorithms (including the binary remainder method, continued fraction unit fraction algorithm, generalized remainder method, greedy algorithm, reverse greedy algorithm, small multiple method, and splitting algorithm) for decomposing an arbitrary positive fraction into unit fractions. According to Martin (1999, p. 3641), Fibonacci published an algorithm for constructing unit fraction representations in 1202, and this algorithm was subsequently rediscovered by Sylvester.

Taking the fractions 1/2, 1/3, 2/3, 1/4, 2/4, 3/4, ... (the numerators of which are OEIS A002260, and the denominators of which are n-1 copies of the integer n), the unit fraction representations using the greedy algorithm are

1/2=1/2
(8)
1/3=1/3
(9)
2/3=1/2+1/6
(10)
1/4=1/4
(11)
2/4=1/2
(12)
3/4=1/2+1/4
(13)
1/5=1/5
(14)
2/5=1/3+1/(15)
(15)
3/5=1/2+1/(10)
(16)
4/5=1/2+1/4+1/(20).
(17)

The number of terms in these representations are 1, 1, 2, 1, 1, 2, 1, 2, 2, 3, 1, ... (OEIS A050205). The minimum denominators for each representation are given by 2, 3, 2, 4, 2, 2, 5, 3, 2, 2, 6, 3, 2, ... (OEIS A050206), and the maximum denominators are 2, 3, 6, 4, 2, 4, 5, 15, 10, 20, 6, 3, 2, ... (OEIS A050210).

The Egyptian fractions for the fractional parts of various constants using the greedy algorithm are summarized in the following table, where K denotes Catalan's constant.

constant xOEISEgyptian fraction for frac(x)
sqrt(2)A0064873, 13, 253, 218201, 61323543802, ...
sqrt(3)A1183252, 5, 32, 1249, 5986000, 438522193400489, ...
2^(-1/2)A0691392, 5, 141, 68575, 32089377154, ...
eA0065252, 5, 55, 9999, 3620211523, 25838201785967533906, ...
e^(-1)A0065263, 29, 15786, 513429610, 339840390654894740, ...
gammaA1108202, 13, 3418, 52016149, 153922786652714666, ...
KA1183232, 3, 13, 176, 36543, ...
phiA1171162, 9, 145, 37986, 2345721887, ...
ln2A1183242, 6, 38, 6071, 144715221, ...
piA0014668, 61, 5020, 128541455, 162924332716605980, ...
pi^(-1)A0065244, 15, 609, 845029, 1010073215739, ...

Graham proved that infinitely many fractions in a certain range can be represented as a sum of unit fractions with square denominators (Hoffman 1998, p. 156).

The Erdős-Straus conjecture asserts that the Diophantine equation

 4/n=1/a+1/b+1/c
(18)

has a solution in positive integers a, b, and c for every integer n>=2, without requiring distinct denominators. Similarly, Sierpiński (1956) conjectured that

 5/n=1/a+1/b+1/c
(19)

can be solved under the same conditions (Guy 1994).

The harmonic number H_n is never an integer except for H_1. According to Hoffman (1998, p. 157), Taeisinger proved this result in 1915, and Kürschák proved in 1918 the more general result that a sum of at least two reciprocals of consecutive positive integers never equals an integer. Equally spaced denominators can give a unit fraction; for example, 1/3+1/6=1/2.

Nontrivial sets of integers are known whose reciprocals sum to small integers. For example, there exists a set of 366 positive integers (with maximum 992) whose sum of reciprocals is exactly 2 (Mackenzie 1997; Martin). A similar set of 453 small positive integers is known whose reciprocals sum to 6 (Martin).

OpenAI (2026) announced that every rational number a/b with integers 1<=a<b can be expressed using O(lnlnb) distinct unit fractions, with unrestricted denominators. The claimed order is optimal in the worst case over the numerators for a fixed denominator b. The assertion is a worst-case bound and does not require every individual fraction to have that many terms.

Bloom and van Doorn (2026) give a human exposition and simplification, obtaining the explicit bound (16/ln2+o(1))lnlnb for the number of distinct unit fractions needed. They also prove double-exponential growth for two related quantities. If F(k) counts representations of 1 by exactly k distinct positive unit fractions, with increasing denominators, and v(k) is the least integer at least 2 absent as a denominator from every such representation, then lnlnF(k)=Theta(k) and lnlnv(k)=Theta(k) as k->infty.


See also

Akhmim Wooden Tablet, Egyptian Mathematical Leather Roll, Egyptian Number, Engel Expansion, Erdős-Straus Conjecture, Harmonic Number, Rhind Papyrus, Unit Fraction

Explore with Wolfram|Alpha

References

Beck, A.; Bleicher, M. N.; and Crowe, D. W. Excursions into Mathematics. New York: Worth Publishers, 1970.Beeckmans, L. "The Splitting Algorithm for Egyptian Fractions." J. Number Th. 43, 173-185, 1993.Bleicher, M. N. "A New Algorithm for the Expansion of Continued Fractions." J. Number Th. 4, 342-382, 1972.Bloom, T. F. and van Doorn, W. "Optimal Bounds for the Length and Number of Unit Fraction Representations." 20 Oct 2026. https://hexagonmath.org/2610.00407v1.Breusch, R. "A Special Case of Egyptian Fractions." Solution to advanced problem 4512. Amer. Math. Monthly 61, 200-201, 1954.Conlon, D.; Fox, J.; He, X.; Mubayi, D.; Pham, H. T.; Suk, A.; and Verstraëte, J. "A Question of Erdős and Graham on Egyptian Fractions." Discrete Anal. 2025:28, 1-13, 2025. https://doi.org/10.19086/da.154329.Eppstein, D. "Algorithms for Egyptian Fractions: Brute Force Methods." https://ics.uci.edu/~eppstein/numth/egypt/force.html.Eppstein, D. "Egyptian Fractions." https://ics.uci.edu/~eppstein/numth/egypt/.Eppstein, D. "Ten Algorithms for Egyptian Fractions." Mathematica Educ. Res. 4, 5-15, 1995.Eppstein, D. Egypt.ma Mathematica notebook. https://ics.uci.edu/~eppstein/numth/egypt/egypt.ma.Update a linkGardner, M. "Babylonian and Egyptian Mathematics, an Egyptian Historical Gap, Installments 1-3." http://www.teleport.com/~ddonahue/phresour.htmlGardner, M. "Mathematical Games: In Which a Mathematical Aesthetic Is Applied to Modern Minimal Art." Sci. Amer. 239, 22-32, Nov. 1978.Golomb, S. W. "An Algebraic Algorithm for the Representation Problems of the Ahmes Papyrus." Amer. Math. Monthly 69, 785-786, 1962.Graham, R. "On Finite Sums of Unit Fractions." Proc. London Math. Soc. 14, 193-207, 1964.Guy, R. K. "Egyptian Fractions." §D11 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 158-166, 1994.Hoffman, P. The Man Who Loved Only Numbers: The Story of Paul Erdős and the Search for Mathematical Truth. New York: Hyperion, pp. 153-157, 1998.Ke, Z. and Sun, Q. "On the Representation of 1 by Unit Fractions." Sichuan Daxue Xuebao 1, 13-29, 1964.Keith, M. "Egyptian Unit Fractions." https://www.mathpages.com/home/kmath340/kmath340.htm.Klee, V. and Wagon, S. Old and New Unsolved Problems in Plane Geometry and Number Theory. Washington, DC: Math. Assoc. Amer., pp. 175-177 and 206-208, 1991.Liu, Y. P. and Sawhney, M. "On Further Questions Regarding Unit Fractions." 10 Apr 2024. https://arxiv.org/abs/2404.07113.Loy, J. "Egyptian Fractions." https://web.archive.org/web/20040203031114/http://www.jimloy.com/egypt/fraction.htm.Mackenzie, D. "Fractions to Make an Egyptian Scribe Blanch." Science 278, 224, 1997.Martin, G. "Dense Egyptian Fractions." Trans. Amer. Math. Soc. 351, 3641-3657, 1999.Martin, G. Egyptian fraction summing to 2. https://personal.math.ubc.ca/~gerg/papers/downloads/recsum2.pdf.Martin, G. Egyptian fraction summing to 6. https://personal.math.ubc.ca/~gerg/papers/downloads/recsum6.pdf.MathPages. "Egyptian Unit Fractions." https://www.mathpages.com/home/kmath340/kmath340.htm.Niven, I. and Zuckerman, H. S. An Introduction to the Theory of Numbers, 5th ed. New York: Wiley, p. 200, 1991.Numberphile. "Egyptian Fractions and the Greedy Algorithm." Dec. 12, 2023. https://www.youtube.com/watch?v=aVUUbNbQkbQ.OpenAI. "Short Egyptian Fractions." Sep. 25, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Short-Egyptian-fractions-September-25-2026/Short-Egyptian-fractions-September-25-2026.pdf.Séroul, R. "Egyptian Fractions." §8.8 in Programming for Mathematicians. Berlin, Germany: Springer-Verlag, pp. 181-187, 2000.Sierpiński, W. "Sur les décompositiones de nombres rationelles en fractions primaires." Mathesis 65, 16-32, 1956.Sloane, N. J. A. Sequences A001466/M4553, A002260, A006487/M2962, A006524/M3509, A006525/M1553, A006526/M3122, A050205, A050206, A050210, A069139, A110820, A117116, A118323, A118324, and A118325 in "The On-Line Encyclopedia of Integer Sequences."Starke, E. P. "Problem 4512." Amer. Math. Monthly 59, 640, 1952.Stewart, I. "The Riddle of the Vanishing Camel." Sci. Amer. 266, 122-124, June 1992.Tenenbaum, G. and Yokota, H. "Length and Denominators of Egyptian Fractions." J. Number Th. 35, 150-156, 1990.Vose, M. "Egyptian Fractions." Bull. London Math. Soc. 17, 21, 1985.Wagon, S. "Egyptian Fractions." §8.6 in Mathematica in Action. New York: W. H. Freeman, pp. 271-277, 1991.Wells, D. The Penguin Dictionary of Curious and Interesting Numbers. Middlesex, England: Penguin Books, p. 29, 1986.

Referenced on Wolfram|Alpha

Egyptian Fraction

Cite this as:

Weisstein, Eric W. "Egyptian Fraction." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/EgyptianFraction.html

Subject classifications