Text
The ancient Egyptians wrote every fraction as a sum of distinct unit fractions (numerator ) using the greedy algorithm: at each step you subtract the largest possible unit fraction. Apply the method to .
Solution
Step 1. ; the largest unit fraction not exceeding it is (since ). Subtracting: Step 2. ; the largest unit fraction not exceeding it is (since ). Subtracting, with common denominator : The numerator is now , so we stop: