Solution: Find the Egyptian Fraction

Solution

We can generate Egyptian Fractions using Greedy Algorithm. For a given number of the form n/d, where d > n, first find the greatest possible unit fraction, then perform recursion for the remaining part.

For example, consider $6/14$ ...