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.

(36 lines omitted)
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+