8.2 Egyptian Fractions

Each fraction can be expressed as a sum of different fractions with unit numerators.

$87--= 1+ 1-+ -1- 110 2 5 11$
A given fraction might have more than one representation.
Approach: at each stage add the largest unit fraction which does not cause the sum to exceed the fraction.
Fibonacci proved that the above algorithm is guaranteed to halt.