Exercise 644Number theory › Diophantine equationsM1Added 5 Nov 2026
Writing 1 as a sum of unit fractions
#Egyptian fractions#bounding#Diophantine
Statement
- Find all positive integers with .
- Prove that for every , the number is a sum of distinct unit fractions.
Hint
For part 1, the smallest denominator must satisfy . For part 2, use .
Show solutionHide solution
Solution
1. Bounding. gives ; and (else the sum exceeds ).
- : with , so , ; also . If : , . If : , .
- : with , so gives ; thus and .
The solutions are , , .
2. Distinct denominators. For : . From a representation with distinct denominators, take the largest denominator and replace by (true because ). Both new denominators exceed , hence all the others, and they are different from each other. This gives a representation with distinct denominators. Induction finishes.
Example. .
Lesson. In equations with a symmetric sum, order the variables and bound the smallest one; the identity is the basic splitting step for unit fractions.