Maths Olympiad Prep

Library / /292 of 1394

, 2025

Number theory Difficulty 5.0 AIME Prove it United States

Problem:

Let aa, bb, and cc be pairwise distinct positive integers such that 1a\frac{1}{a}, 1b\frac{1}{b}, 1c\frac{1}{c} is an increasing arithmetic sequence in that order. Prove that gcd(a,b)>1\gcd(a, b) > 1.

Solutions — 2

Solution 1

Solution:

Observe that 1a+1c=2b\frac{1}{a} + \frac{1}{c} = \frac{2}{b}, so b(a+c)=2acb(a + c) = 2ac, and thus ab(a+c)a \mid b(a + c). If we assume that gcd(a,b)=1\gcd(a, b) = 1, then we must have aa+ca \mid a + c, so aca \mid c. However, 1a<1c\frac{1}{a} < \frac{1}{c}, so a>ca > c, contradiction. Thus, gcd(a,b)>1\gcd(a, b) > 1, as desired.

Solution 2

Solution:

Observe that 2b1a=1c\frac{2}{b} - \frac{1}{a} = \frac{1}{c}, so (2ab)c=ab(2a - b)c = ab and thus 2abab2a - b \mid ab. If we assume that gcd(a,b)=1\gcd(a, b) = 1, then gcd(2ab,a)=1\gcd(2a - b, a) = 1, so 2abb2a - b \mid b. Then 2ab(2ab)+b=2a2a - b \mid (2a - b) + b = 2a, so 2abgcd(2a,b)22a - b \mid \gcd(2a, b) \leq 2. Thus 2ab22a - b \leq 2. But a>ba > b, contradiction. Thus, gcd(a,b)>1\gcd(a, b) > 1, as desired.

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

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