Maths WorkshopMaths problems with full solutions
Exercise 644Number theory › Diophantine equationsM1Added 5 Nov 2026

Writing 1 as a sum of unit fractions

#Egyptian fractions#bounding#Diophantine

Statement

  1. Find all positive integers a≤b≤ca\le b\le c with 1a+1b+1c=1\dfrac1a+\dfrac1b+\dfrac1c=1.
  2. Prove that for every k≥3k\ge3, the number 11 is a sum of kk distinct unit fractions.
Hint

For part 1, the smallest denominator aa must satisfy 3a≥1\frac3a\ge1. For part 2, use 1m=1m+1+1m(m+1)\frac1m=\frac1{m+1}+\frac1{m(m+1)}.

Show solutionHide solution

Solution

1. Bounding. 1=1a+1b+1c≤3a1=\frac1a+\frac1b+\frac1c\le\frac3a gives a≤3a\le3; and a≥2a\ge2 (else the sum exceeds 11).

  • a=2a=2: 1b+1c=12\frac1b+\frac1c=\frac12 with b≤cb\le c, so 2b≥12\frac2b\ge\frac12, b≤4b\le4; also b>2b>2. If b=3b=3: 1c=16\frac1c=\frac16, c=6c=6. If b=4b=4: 1c=14\frac1c=\frac14, c=4c=4.
  • a=3a=3: 1b+1c=23\frac1b+\frac1c=\frac23 with b≥3b\ge3, so 2b≥23\frac2b\ge\frac23 gives b≤3b\le3; thus b=3b=3 and c=3c=3.

The solutions are (2,3,6)(2,3,6), (2,4,4)(2,4,4), (3,3,3)(3,3,3).

2. Distinct denominators. For k=3k=3: 1=12+13+161=\frac12+\frac13+\frac16. From a representation with kk distinct denominators, take the largest denominator mm and replace 1m\frac1m by 1m+1+1m(m+1)\frac1{m+1}+\frac1{m(m+1)} (true because 1m−1m+1=1m(m+1)\frac1m-\frac1{m+1}=\frac1{m(m+1)}). Both new denominators exceed mm, hence all the others, and they are different from each other. This gives a representation with k+1k+1 distinct denominators. Induction finishes.

Example. 1=12+13+17+1421=\frac12+\frac13+\frac17+\frac1{42}.

Lesson. In equations with a symmetric sum, order the variables and bound the smallest one; the identity 1m=1m+1+1m(m+1)\frac1m=\frac1{m+1}+\frac1{m(m+1)} is the basic splitting step for unit fractions.