| |
| | Egyptian Fraction -- from MathWorld |
 | | Any 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. |
 | | 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. |
 | | However, there are 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 fraction into unit fractions. |
| users.skynet.be /fa956617/math/topics/EgyptianFraction.html (804 words) |
|