Algorithms for Egyptian Fractions
Algorithms for Egyptian Fractions
In ancient Egypt, a fraction was represented as a sum of fractions with numerator one. Any number has infinitely many Egyptian fraction representations, although there are only finitely many that have a given number of terms. Today many algorithms are known, each producing a different number of unit fractions, different size denominators (some of which can be very large), and different times to complete.
External Links
External Links
Permanent Citation
Permanent Citation
Enrique Zeleny, David Eppstein
"Algorithms for Egyptian Fractions"
http://demonstrations.wolfram.com/AlgorithmsForEgyptianFractions/
Wolfram Demonstrations Project
Published: October 4, 2007