# Algorithms for Egyptian Fractions

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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.

Contributed by: Enrique Zeleny (March 2011)

Based on programs by: David Eppstein

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

detailSectionParagraph## Permanent Citation

"Algorithms for Egyptian Fractions"

http://demonstrations.wolfram.com/AlgorithmsForEgyptianFractions/

Wolfram Demonstrations Project

Published: March 7 2011