Solution: Find the Egyptian Fraction
This review provides a detailed analysis of how to convert a fraction to a series of Egyptian Fractions.
We'll cover the following...
We'll cover the following...
Solution #
Explanation
We can generate Egyptian Fractions using the greedy algorithm. For a given number of the form n/d, where d > n, find the greatest possible unit fraction, then perform recursion for the remaining part.
For example, consider . We first find the ceiling of ...