Content deleted Content added
m Open access bot: doi added to citation with #oabot. |
m →References: fix diacritic |
||
(38 intermediate revisions by 21 users not shown) | |||
Line 1:
{{
[[File:
An '''Egyptian fraction''' is a finite sum of distinct [[unit fraction]]s, such as
That is, each [[
== Applications ==
Beyond their historical use, Egyptian fractions have some practical advantages over other representations of fractional numbers.
For instance, Egyptian fractions can help in dividing
<math display=block>\frac{5}{8}=\frac{1}{2}+\frac{1}{8}</math>
means that each diner gets half a pizza plus another eighth of a pizza, for example by splitting 4 pizzas into 8 halves, and the remaining pizza into 8 eighths. Exercises in performing this sort of [[fair division]] of food are a standard classroom example in teaching students to work with unit fractions.{{sfnp|Wilson|Edgington|Nguyen|Pescosolido|2011}}
Egyptian fractions can provide a solution to [[rope-burning puzzle]]s, in which a given duration is to be measured by igniting non-uniform ropes which burn out after a unit time. Any rational fraction of a unit of time can be measured by expanding the fraction into a sum of unit fractions and then, for each unit fraction <math>1/x</math>, burning a rope so that it always has <math>x</math> simultaneously lit points where it is burning. For this application, it is not necessary for the unit fractions to be distinct from each other. However, this solution may need an infinite number of re-lighting steps.{{sfnp|Winkler|2004}}
== Early history ==
{{further|Egyptian numerals|Egyptian mathematics}}
Egyptian fraction notation was developed in the [[Middle Kingdom of Egypt]]. Five early texts in which Egyptian fractions appear were the [[Egyptian Mathematical Leather Roll]], the [[Moscow Mathematical Papyrus]], the [[Reisner Papyrus]], the [[Kahun Papyrus]] and the [[Akhmim Wooden Tablet]]. A later text, the [[Rhind Mathematical Papyrus]], introduced improved ways of writing Egyptian fractions. The Rhind papyrus was written by [[Ahmes]] and dates from the [[Second Intermediate Period]]; it includes a [[RMP 2/n table|table of Egyptian fraction expansions for rational numbers <math>\tfrac{2}{n}</math>]], as well as 84 [[Word problem (mathematics education)|word problems]]. Solutions to each problem were written out in scribal shorthand, with the final answers of all 84 problems being expressed in Egyptian fraction notation. Tables of expansions for <math>\tfrac{2}{n}</math> similar to the one on the Rhind papyrus also appear on some of the other texts. However, as the [[Kahun Papyrus]] shows, [[vulgar fraction]]s were also used by scribes within their calculations.
=== Notation ===
To write the unit fractions used in their Egyptian fraction notation, in hieroglyph script, the Egyptians placed the [[Egyptian hieroglyphs|hieroglyph]]:
{| border=0 style="margin-left: 1.6em;
|<hiero>D21</hiero>
|}
(''er'', "<nowiki>[one]</nowiki> among" or possibly ''re'', mouth) above a number to represent the [[Multiplicative inverse|reciprocal]] of that number. Similarly in hieratic script they drew a line over the letter representing the number. For example:
{|
|<hiero>D21:Z1*Z1*Z1</hiero>
| style="padding-right:1em;" |<math>= \frac{1}{3}</math>
Line 37 ⟶ 32:
|}
The Egyptians had special symbols for <math>\tfrac{1
{| cellpadding="1em" style="margin-left: 1.6em;
|<hiero>Aa13</hiero>
| style="padding-right:1em;" |<math>= \frac{1}{2}</math>
Line 47 ⟶ 42:
|<math>= \frac{3}{4}</math>
|}
The Egyptians also used an alternative notation modified from the Old Kingdom to denote a special set of fractions of the form <math>1/2
They were used in the Middle Kingdom in conjunction with the later notation for Egyptian fractions to subdivide a [[hekat (volume unit)|hekat]], the primary ancient Egyptian volume measure for grain, bread, and other small quantities of volume, as described in the [[Akhmim Wooden Tablet]]. If any remainder was left after expressing a quantity in Eye of Horus fractions of a hekat, the remainder was written using the usual Egyptian fraction notation as multiples of a ''ro'', a unit equal to <math>\tfrac{1
=== Calculation methods ===
Modern historians of mathematics have studied the Rhind papyrus and other ancient sources in an attempt to discover the methods the Egyptians used in calculating with Egyptian fractions. In particular, study in this area has concentrated on understanding the tables of expansions for numbers of the form <math>\tfrac{2
* For small odd prime denominators
* For larger prime denominators, an expansion of the form <math display=block>\frac{2}{
* For some composite denominators, factored as
* One can also expand <math display=block>\frac{2
* The final (prime) expansion in the Rhind papyrus, <math>\tfrac{2}{101}</math>, does not fit any of these forms, but instead uses an expansion <math display=block>\frac{2}{p} = \frac{1}{p} + \frac{1}{2p} + \frac{1}{3p} + \frac{1}{6p}</math> that may be applied regardless of the value of <math>p</math>. That is, <math>\tfrac{2}{101} = \tfrac{1}{101} + \tfrac{1}{202} + \tfrac{1}{303} + \tfrac{1}{606}</math>. A related expansion was also used in the Egyptian Mathematical Leather Roll for several cases.
== Later usage ==
Egyptian fraction notation continued to be used in Greek times and into the Middle Ages,{{sfnp|Struik|1967}} despite complaints as early as [[Ptolemy]]'s [[Almagest]] about the clumsiness of the notation compared to alternatives such as the [[Babylonian mathematics|Babylonian]] [[sexagesimal|base-60 notation]]. Related problems of decomposition into unit fractions were also studied in 9th-century India by Jain mathematician [[Mahāvīra (mathematician)|Mahāvīra]].{{sfnp|Kusuba|2004}} An important text of medieval European mathematics, the ''[[Liber Abaci]]'' (1202) of [[Leonardo of Pisa]] (more commonly known as Fibonacci), provides some insight into the uses of Egyptian fractions in the Middle Ages, and introduces topics that continue to be important in modern mathematical study of these series.
The primary subject of the ''Liber Abaci'' is calculations involving decimal and vulgar fraction notation, which eventually replaced Egyptian fractions. Fibonacci himself used a complex notation for fractions involving a combination of a [[mixed radix]] notation with sums of fractions. Many of the calculations throughout Fibonacci's book involve numbers represented as Egyptian fractions, and one section of this book<ref>{{harvtxt|Sigler|2002}}, chapter II.7</ref> provides a list of methods for conversion of vulgar fractions to Egyptian fractions. If the number is not already a unit fraction, the first method in this list is to attempt to split the numerator into a sum of divisors of the denominator; this is possible whenever the denominator is a [[practical number]], and ''Liber Abaci'' includes tables of expansions of this type for the practical numbers 6, 8, 12, 20, 24, 60, and 100.
The next several methods involve algebraic identities such as
<math display=block>\frac{a}{ab-1}=\frac{1}{b}+\frac{1}{b(ab-1)}.</math>
For instance, Fibonacci represents the fraction {{sfrac|8|11}} by splitting the numerator into a sum of two numbers, each of which divides one plus the denominator: {{nowrap|1={{sfrac|8|11}} = {{sfrac|6|11}} + {{sfrac|2|11}}}}. Fibonacci applies the algebraic identity above to each these two parts, producing the expansion {{nowrap|1={{sfrac|8|11}} = {{sfrac|1|2}} + {{sfrac|1|22}} + {{sfrac|1|6}} + {{sfrac|1|66}}}}. Fibonacci describes similar methods for denominators that are two or three less than a number with many factors.
In the rare case that these other methods all fail, Fibonacci suggests a [[Greedy algorithm for Egyptian fractions|"greedy" algorithm]] for computing Egyptian fractions, in which one repeatedly chooses the unit fraction with the smallest denominator that is no larger than the remaining fraction to be expanded: that is, in more modern notation, we replace a fraction {{sfrac|''x''|''y''}} by the expansion
<math display=block>\frac{x}{y}=\frac{1}{\,\left\lceil \frac{y}{x} \right\rceil\,}+\frac{(-y)\,\bmod\, x}{y\left\lceil \frac{y}{x}\right\rceil},</math>
where {{nowrap|⌈ ⌉}} represents the [[Floor and ceiling functions|ceiling function]]; since {{nowrap|(−''y'') mod ''x'' < ''x''}}, this method yields a finite expansion.
Fibonacci suggests switching to another method after the first such expansion, but he also gives examples in which this greedy expansion was iterated until a complete Egyptian fraction expansion was constructed:
Compared to ancient Egyptian expansions or to more modern methods, this method may produce expansions that are quite long, with large denominators, and Fibonacci himself noted the awkwardness of the expansions produced by this method. For instance, the greedy method expands
while other methods lead to the shorter expansion
[[Sylvester's sequence]] 2, 3, 7, 43, 1807, ... can be viewed as generated by an infinite greedy expansion of this type for the number
After his description of the greedy algorithm, Fibonacci suggests yet another method, expanding a fraction
== Modern number theory ==
{{further|Erdős–Graham problem|Znám's problem|Engel expansion}}
Although Egyptian fractions are no longer used in most practical applications of mathematics, modern number theorists have continued to study many different problems related to them. These include problems of bounding the length or maximum denominator in Egyptian fraction representations, finding expansions of certain special forms or in which the denominators are all of some special type, the termination of various methods for Egyptian fraction expansion, and showing that expansions exist for any sufficiently dense set of sufficiently [[smooth number]]s.
*One of the earliest publications of [[Paul Erdős]] proved that it is not possible for a [[Harmonic progression (mathematics)|harmonic progression]] to form an Egyptian fraction representation of an [[integer]]. The reason is that, necessarily, at least one denominator of the progression will be divisible by a [[prime number]] that does not divide any other denominator.<ref>{{harvtxt|Erdős|1932}}; {{harvtxt|Graham|2013}}</ref> The latest publication of Erdős, nearly 20 years after his death, proves that every integer has a representation in which all denominators are products of three primes.{{sfnp|Butler|Erdős|Graham|2015}}
*The [[Erdős–Graham conjecture]] in [[Number theory|combinatorial number theory]] states that, if the integers greater than 1 are partitioned into finitely many subsets, then one of the subsets has a finite subset of itself whose reciprocals sum to one. That is, for every {{nowrap|''r'' > 0}}, and every ''r''-coloring of the integers greater than one, there is a finite monochromatic subset ''S'' of these integers such that <math display=block>\sum_{n\in S}\frac{1}{n} = 1.</math> The conjecture was proven in 2003 by [[Ernest S. Croot III]].
*[[Znám's problem]] and [[primary pseudoperfect number]]s are closely related to the existence of Egyptian fractions of the form <math display=block>\sum\frac1{x_i} + \prod\frac1{x_i}=1.</math> For instance, the primary pseudoperfect number 1806 is the product of the prime numbers 2, 3, 7, and 43, and gives rise to the Egyptian fraction {{nowrap|1=1 = {{sfrac|1|2}} + {{sfrac|1|3}} + {{sfrac|1|7}} + {{sfrac|1|43}} + {{sfrac|1|1806}}}}.
*Egyptian fractions are normally defined as requiring all denominators to be distinct, but this requirement can be relaxed to allow repeated denominators. However, this relaxed form of Egyptian fractions does not allow for any number to be represented using fewer fractions, as any expansion with repeated fractions can be converted to an Egyptian fraction of equal or smaller length by repeated application of the replacement <math display=block>\frac1k+\frac1k=\frac2{k+1}+\frac2{k(k+1)}</math> if ''k'' is odd, or simply by replacing {{nowrap|{{sfrac|1|''k''}} + {{sfrac|1|''k''}}}} by {{sfrac|2|''k''}} if ''k'' is even. This result was first proven by {{harvtxt|Takenouchi|1921}}.
*Graham and Jewett<ref>See {{harvtxt|Wagon|1999}} and {{harvtxt|Beeckmans|1993}}</ref> proved that it is similarly possible to convert expansions with repeated denominators to (longer) Egyptian fractions, via the replacement <math display=block>\frac1k+\frac1k=\frac1k+\frac1{k+1}+\frac1{k(k+1)}.</math> This method can lead to long expansions with large denominators, such as <math display=block>\frac45=\frac15+\frac16+\frac17+\frac18+\frac1{30}+\frac1{31}+\frac1{32}+\frac1{42}+\frac1{43}+\frac1{56}+
\frac1{930}+\frac1{931}+\frac1{992}+\frac1{1806}+\frac1{865\,830}.</math> {{harvtxt|Botts|1967}} had originally used this replacement technique to show that any rational number has Egyptian fraction representations with arbitrarily large minimum denominators.
*Any fraction {{sfrac|''x''|''y''}} has an Egyptian fraction representation in which the maximum denominator is bounded by{{sfnp|Yokota|1988}} <math display=block>O\left(y \log y \left(\log\log y\right)^4 \left(\log\log\log y\right)^2\right),</math> and a representation with at most <math display=block>O\left(\sqrt{\log y}\right)</math> terms.{{sfnp|Vose|1985}} The number of terms must sometimes be at least proportional to {{nowrap|log log ''y''}}; for instance this is true for the fractions in the sequence {{sfrac|1|2}}, {{sfrac|2|3}}, {{sfrac|6|7}}, {{sfrac|42|43}}, {{sfrac|1806|1807}}, ... whose denominators form [[Sylvester's sequence]]. It has been conjectured that {{nowrap|''O''(log log ''y'')}} terms are always enough.{{sfnp|Erdős|1950}} It is also possible to find representations in which both the maximum denominator and the number of terms are small.{{sfnp|Tenenbaum|Yokota|1990}}
*{{harvtxt|Graham|1964}} characterized the numbers that can be represented by Egyptian fractions in which all denominators are ''n''th powers. In particular, a rational number ''q'' can be represented as an Egyptian fraction with square denominators if and only if ''q'' lies in one of the two half-open intervals <math display=block>\left[0,\frac{\pi^2}{6}-1\right)\cup\left[1,\frac{\pi^2}{6}\right).</math>
*{{harvtxt|Martin|1999}} showed that any rational number has very dense expansions, using a constant fraction of the denominators up to ''N'' for any sufficiently large ''N''.
*[[Engel expansion]], sometimes called an ''Egyptian product'', is a form of Egyptian fraction expansion in which each denominator is a multiple of the previous one: <math display=block>x=\frac{1}{a_1}+\frac{1}{a_1a_2}+\frac{1}{a_1a_2a_3}+\cdots.</math> In addition, the sequence of multipliers ''a<sub>i</sub>'' is required to be nondecreasing. Every rational number has a finite Engel expansion, while [[irrational number]]s have an infinite Engel expansion.
*{{harvtxt|Anshel|Goldfeld|1991}} study numbers that have multiple distinct Egyptian fraction representations with the same number of terms and the same product of denominators; for instance, one of the examples they supply is <math display=block>\frac{5}{12}=\frac{1}{4}+\frac{1}{10}+\frac{1}{15}=\frac{1}{5}+\frac{1}{6}+\frac{1}{20}.</math> Unlike the ancient Egyptians, they allow denominators to be repeated in these expansions. They apply their results for this problem to the characterization of [[free product]]s of [[Abelian group]]s by a small number of numerical parameters: the rank of the [[commutator subgroup]], the number of terms in the free product, and the product of the orders of the factors.
*The number of different ''n''-term Egyptian fraction representations of the number one is bounded above and below by [[double exponential function]]s of ''n''.{{sfnp|Konyagin|2014}}
== Open problems ==
Some notable problems remain unsolved with regard to Egyptian fractions, despite considerable effort by mathematicians.
* The [[Erdős–Straus conjecture]]{{sfnp|Erdős|1950}} concerns the length of the shortest expansion for a fraction of the form {{sfrac|4
* It is unknown whether an [[odd greedy expansion]] exists for every fraction with an odd denominator. If Fibonacci's greedy method is modified so that it always chooses the smallest possible ''odd'' denominator, under what conditions does this modified algorithm produce a finite expansion? An obvious necessary condition is that the starting fraction {{sfrac|''x''|''y''}} have an odd denominator ''y'', and it is conjectured but not known that this is also a sufficient condition. It is known<ref>{{harvtxt|Breusch|1954}}; {{harvtxt|Stewart|1954}}</ref> that every {{sfrac|''x''|''y''}} with odd ''y'' has an expansion into distinct odd unit fractions, constructed using a different method than the greedy algorithm.
* It is possible to use [[brute-force search]] algorithms to find the Egyptian fraction representation of a given number with the fewest possible terms{{sfnp|Stewart|1992}} or minimizing the largest denominator; however, such algorithms can be quite inefficient. The existence of [[polynomial time]] algorithms for these problems, or more generally the [[Analysis of algorithms|computational complexity]] of such problems, remains unknown.
{{harvtxt|Guy|2004}} describes these problems in more detail and lists numerous additional open problems.
==
*[[List of sums of reciprocals]]
*[[17-animal inheritance puzzle]]
== Notes ==
{{
== References ==
{{refbegin|30em}}
*{{citation
Line 160 ⟶ 128:
| volume = 111
| year = 1991| doi-access = free
}}
*{{citation
| last = Beeckmans | first = L.
Line 170 ⟶ 138:
| volume = 43
| year = 1993
| issue = 2
}}
*{{citation
| doi = 10.2307/2688508
Line 181 ⟶ 150:
| jstor = 2688508
| volume = 40
| year = 1967}}
*{{citation
| last = Breusch | first = R. | author-link = Robert Breusch
Line 189 ⟶ 158:
| volume = 61
| doi = 10.2307/2307234
| year = 1954| jstor = 2307234 }}
*{{citation
| last = Bruins | first = Evert M.
Line 198 ⟶ 167:
| trans-title = Plato and the Egyptian 2/''n'' table
| volume = 46
| year = 1957}}
*{{citation
| last1 = Butler | first1 = Steve | author1-link = Steve Butler (mathematician)
Line 209 ⟶ 178:
| url = https://www.math.ucsd.edu/~ronspubs/pre_tres_egyptian.pdf
| volume = 15
| year = 2015}}
*{{citation
| last1 = Dick | first1 = Lara K.
| last2 = Ogle | first2 = Rebecca
| date = September 2018
| journal = Ohio Journal of School Mathematics
| pages = 1–7
| title = Think like an Egyptian
| volume = 80}}
*{{citation|first=P.|last= Erdős |authorlink=Paul Erdős |title=Egy Kürschák-féle elemi számelméleti tétel általánosítása|trans-title=Generalization of an elementary number-theoretic theorem of Kürschák|language=Hungarian|journal=Mat. Fiz. Lapok|volume=39|year=1932|pages=17–24|url=https://www.renyi.hu/~p_erdos/1932-02.pdf}}
*{{citation
| last = Erdős | first = Pál | authorlink = Paul Erdős
Line 216 ⟶ 193:
| mr = 0043117
| pages = 192–210
| title = Az <math>\textstyle\frac{1}{x_1}+\frac{1}{x_2}+\cdots+\frac{1}{x_n}=\frac{a}{b}</math> egyenlet egész számú megoldásairól
| trans-title = On a Diophantine equation
| language = Hungarian
| url = https://www.renyi.hu/~p_erdos/1950-02.pdf
| volume = 1
| year = 1950}}
*{{citation
| last = Eves | first = Howard | author-link = Howard Eves
Line 227 ⟶ 204:
| publisher = Holt, Reinhard, and Winston
| title = An Introduction to the History of Mathematics
| year = 1953}}
*{{citation
| last = Gardner | first = Milo
| contribution = The Egyptian Mathematical Leather Roll, attested short term and long term
| editor-last = Gratton-Guinness| editor-first = Ivor | editor-link=Ivor Grattan-Guinness
| isbn = 81-85931-45-3
| pages = 119–134
Line 244 ⟶ 221:
| page = 50
| url = {{Google books|DoDMIVUIYFwC|page=50|plainurl=yes}}
| year = 1982}}
*{{citation
| last = Graham | first = R. L. | author-link = Ronald Graham
Line 255 ⟶ 232:
| volume = 14
| year = 1964
| doi=10.2140/pjm.1964.14.85| s2cid = 2629869 }}
*{{citation
| last = Graham | first = Ronald L. | authorlink = Ronald Graham
Line 264 ⟶ 241:
| publisher = János Bolyai Math. Soc., Budapest
| series = Bolyai Soc. Math. Stud.
| title =
| contribution-url = http://www.math.ucsd.edu/~ronspubs/13_03_Egyptian.pdf
| volume = 25
| year = 2013}}
*{{citation
| last = Guy | first = Richard K. | author-link = Richard K. Guy
Line 276 ⟶ 253:
| publisher = Springer-Verlag
| title = Unsolved problems in number theory
| year = 2004}}
*{{citation
| last = Hultsch | first = Friedrich | author-link = Friedrich Hultsch
Line 286 ⟶ 263:
| title = Die Elemente der ägyptischen Theilungsrechnung: Erste Anhandlung
| volume = 17
| year = 1895}}
*{{citation|editor-first=
*{{citation
| last = Knorr | first = Wilbur R. | author-link = Wilbur Knorr
Line 297 ⟶ 274:
| volume = 9
| year = 1982
| issue = 2}}
*{{citation
| last = Konyagin | first = S. V. | authorlink = Sergei Konyagin
| doi = 10.1134/S0001434614010295
| issue =
| journal = [[Mathematical Notes]]
| mr = 3267215
Line 307 ⟶ 284:
| title = Double exponential lower bound for the number of representations of unity by Egyptian fractions
| volume = 95
| year = 2014| s2cid = 121871250 }}
*{{citation
| last1 = Koshaleva | first1 = Olga
| last2 = Kreinovich | first2 = Vladik
| issue = 57
| journal = Mathematical Structures and Modeling
| pages = 46–59
| title = Egyptian fractions as approximators
| url = https://cyberleninka.ru/article/n/egyptian-fractions-as-approximators/viewer
| volume = 1
| year = 2021}}
*{{citation
| last = Kusuba | first = Takanori
| editor1-last = Burnett | editor1-first = Charles
| editor2-last = Hogendijk | editor2-first = Jan P. | editor2-link = Jan Hogendijk
| editor3-last = Plofker | editor3-first = Kim | editor3-link = Kim Plofker
| editor4-last = Yano | editor4-first = Michio
| contribution = Indian rules for the decomposition of fractions
| location = Leiden
| mr = 2054213
| pages = 497–516
| publisher = Brill
| series = Islamic Philosophy Theology and Science: Text and Studies
| title = Studies in the History of the Exact Sciences in honour of David Pingree
| volume = 54
| year = 2004}}
*{{citation
| last = Martin | first = G.
Line 318 ⟶ 320:
| year = 1999
| issue = 9| arxiv = math/9804045
| s2cid = 2591861
}}
*{{citation|last=Ritter|first=Jim|contribution=Closing the Eye of Horus: the Rise and Fall of 'Horus-Eye Fractions'|title=Under One Sky: Astronomy and Mathematics in the ancient Near East|editor1-first=
*{{citation|editor1-first=E.|editor1-last=Robson|editor1-link=Eleanor Robson|editor2-first=J.|editor2-last=Stedall|editor2-link=Jackie Stedall|title=The Oxford Handbook of the History of Mathematics|location=Oxford|publisher=Oxford University Press|year=2009}}
*{{citation
| last = Sigler | first = Laurence E. (trans.)
Line 337 ⟶ 340:
| title = Sums of distinct divisors
| volume = 76
| year = 1954}}
*{{citation
| last = Stewart | first = I. | author-link = Ian Stewart (mathematician)
Line 344 ⟶ 347:
| pages = 122–124
| title = The riddle of the vanishing camel
| year = 1992| volume = 266 | doi = 10.1038/scientificamerican0692-122 | bibcode = 1992SciAm.266f.122S }}
*{{citation
| last = Struik | first = Dirk J. | author-link = Dirk Jan Struik
Line 351 ⟶ 354:
| publisher = Dover
| title = A Concise History of Mathematics
| year = 1967}}
*{{citation
| last = Takenouchi | first = T.
Line 361 ⟶ 364:
| volume = 3
| issue = 6
| year = 1921}}
*{{citation
| last1 = Tenenbaum | first1 = G. | author1-link = Gérald Tenenbaum
Line 373 ⟶ 376:
| year = 1990
| issue = 2| doi-access = free
}}
*{{citation
| last = Vose | first = M.
Line 382 ⟶ 385:
| title = Egyptian fractions
| volume = 17
| year = 1985}}
*{{citation
| last = Wagon | first = Stan | authorlink = Stan Wagon
Line 389 ⟶ 392:
| publisher = Springer
| title = Mathematica in Action
| year = 1999}}
*{{citation
| last1 = Wilson | first1 = P. Holt
| last2 = Edgington | first2 = Cynthia P.
| last3 = Nguyen | first3 = Kenny H.
| last4 = Pescosolido | first4 = Ryan C.
| last5 = Confrey | first5 = Jere
| date = November 2011
| doi = 10.5951/mathteacmiddscho.17.4.0230
| issue = 4
| journal = Mathematics Teaching in the Middle School
| jstor = 10.5951/mathteacmiddscho.17.4.0230
| pages = 230–236
| title = Fractions: how to fair share
| volume = 17}}
*{{citation
| last = Winkler | first = Peter | author-link = Peter Winkler
| contribution = Uses of fuses
| isbn = 1-56881-201-9
| pages = 2, 6
| publisher = A K Peters
| title = Mathematical Puzzles: A Connoisseur's Collection
| year = 2004}}
*{{citation
| last = Yokota | first = Hisashi
Line 399 ⟶ 424:
| title = On a problem of Bleicher and Erdős
| volume = 30
| year = 1988
}}
{{refend}}
== External links ==
*{{citation
| last = Brown | first = Kevin
Line 415 ⟶ 441:
| title = Egyptian fractions
| url = http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fractions/egyptian.html}}.
*{{mathworld|urlname=EgyptianFraction|title=Egyptian Fraction|mode=cs2}}
*{{citation
| last = Giroux | first = André
Line 423 ⟶ 449:
| title = Algorithms for Egyptian Fractions
| url = http://demonstrations.wolfram.com/AlgorithmsForEgyptianFractions/}}, [[The Wolfram Demonstrations Project]], based on programs by [[David Eppstein]].
{{Authority control}}
[[Category:Egyptian fractions| ]]
|