Maths Olympiad Prep

Library / Brazilian Mathematical Olympiad /10 of 120

Brazilian Mathematical Olympiad

Number theory Difficulty 4.5 AIME Prove it Brazil

Show that for any positive integer n>2n > 2 we can find nn distinct positive integers such that the sum of their reciprocals is 11.

Solution

We have 12+13+16=1\frac{1}{2} + \frac{1}{3} + \frac{1}{6} = 1.

Now we have 12+14+18+⋯+12n+12n=1\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + \cdots + \frac{1}{2^n} + \frac{1}{2^n} = 1, replace the second 12n\frac{1}{2^n} by (12+13+16)12n\left(\frac{1}{2} + \frac{1}{3} + \frac{1}{6}\right) \frac{1}{2^n} to get n+3n + 3 terms (n≥1n \ge 1):

12+14+18+⋯+12n+1+13⋅2n+13⋅2n+1=1\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + \cdots + \frac{1}{2^{n+1}} + \frac{1}{3 \cdot 2^n} + \frac{1}{3 \cdot 2^{n+1}} = 1.

For example, we have 12+14+16+112=1\frac{1}{2} + \frac{1}{4} + \frac{1}{6} + \frac{1}{12} = 1 and 12+14+18+112+124=1\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + \frac{1}{12} + \frac{1}{24} = 1.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.