Olympiad Maths Prep

Track / Stage 7 / 45 of 300 #1445 of 2000

Problem 1445

National olympiad second round; IMO P1/P4
Number theory Difficulty 7.1 Prove it Indija TS 2006 · India · 2006

The positive divisors d1,d2,,dld_1, d_2, \dots, d_l of a natural number nn are arranged in the form
1=d1<d2<<dl=n.1 = d_1 < d_2 < \dots < d_l = n.
Suppose it is known that d12+d152=d162d_1^2 + d_{15}^2 = d_{16}^2. Find all possible values of d17d_{17}.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

We use the well known fact that given a triple (a,b,c)(a, b, c) of integers satisfying a2+b2=c2a^2 + b^2 = c^2, then one of a,ba, b is divisible by 44; one of a,ba, b is divisible by 33; and one of a,b,ca, b, c is divisible by 55. Thus 4,34, 3 and 55 are divisors of nn. Let us write
n=2a3b5ctn = 2^a 3^b 5^c t
where α2\alpha \ge 2 and tt is not divisible by 2,3,52, 3, 5. Note that β1,γ1\beta \ge 1, \gamma \ge 1.
Hence
d1=1, d2=2, d3=3, d4=4, d5=5, d6=6.d_1 = 1,\ d_2 = 2,\ d_3 = 3,\ d_4 = 4,\ d_5 = 5,\ d_6 = 6.
Moreover 10=2510 = 2 \cdot 5 is also a divisor of nn. Hence d710d_7 \le 10. Thus d7{7,8,9,10}d_7 \in \{7, 8, 9, 10\}. We explore each of them.

Case 1: Suppose d7=7d_7 = 7. In this case
(d16d15)(d16+d15)=d162d152=d72=49. (d_{16} - d_{15}) (d_{16} + d_{15}) = d_{16}^2 - d_{15}^2 = d_7^2 = 49.
It follows that d16d15=1d_{16} - d_{15} = 1 and d16+d15=49d_{16} + d_{15} = 49. We thus get d16=25d_{16} = 25, d15=24d_{15} = 24. Since d15nd_{15}|n, we see that 88 divides nn. Similarly 25=5225 = 5^2 also divides nn. It follows that α3,γ2\alpha \ge 3, \gamma \ge 2. Since d7=7d_7 = 7 is also a divisor of nn, we may now write
n=2a3b5c7dt1n = 2^a 3^b 5^c 7^d t_1
where tit_i is not divisible by 2,3,5,72, 3, 5, 7; α3,β1,γ2,δ1\alpha \ge 3, \beta \ge 1, \gamma \ge 2, \delta \ge 1.

If β2\beta \ge 2, then 99 divides nn and hence d1=1,d2=2,d3=3,d4=4,d5=5,d6=6,d7=7,d8=8,d9=9,d10=10,d1112,d1214,d1315,d1418,d1520d_1 = 1, d_2 = 2, d_3 = 3, d_4 = 4, d_5 = 5, d_6 = 6, d_7 = 7, d_8 = 8, d_9 = 9, d_{10} = 10, d_{11} \le 12, d_{12} \le 14, d_{13} \le 15, d_{14} \le 18, d_{15} \le 20. This contradicts d15=24d_{15} = 24. We conclude that β=1\beta = 1 and hence n=2a35γ7δt1n = 2^a \cdot 3 \cdot 5^\gamma \cdot 7^\delta t_1.

If α4\alpha \ge 4, then we have
d1=1,d2=2,d3=3,d4=4,d5=5,d6=6,d7=7,d8=8,d9=10,d1012,d1114,d1215,d1316,d1420,d1521d_1 = 1, d_2 = 2, d_3 = 3, d_4 = 4, d_5 = 5, d_6 = 6, d_7 = 7, d_8 = 8, d_9 = 10, d_{10} \le 12, d_{11} \le 14, d_{12} \le 15, d_{13} \le 16, d_{14} \le 20, d_{15} \le 21, which again contradicts d15=24d_{15} = 24. This shows that α=3\alpha = 3 and hence n=233577δt1n = 2^3 3 \cdot 5^7 7^\delta t_1 where gcd(t1,210)=1\text{gcd}(t_1, 210) = 1.

Thus we get
d1=1,d2=2,d3=3,d4=4,d5=5,d6=6,d7=7,d8=8,d9=10,d1012,d1114,d1215,d1320,d1421,d1524d_1 = 1, d_2 = 2, d_3 = 3, d_4 = 4, d_5 = 5, d_6 = 6, d_7 = 7, d_8 = 8, d_9 = 10, d_{10} \le 12, d_{11} \le 14, d_{12} \le 15, d_{13} \le 20, d_{14} \le 21, d_{15} \le 24.
Since d15=24d_{15} = 24 and d16=25d_{16} = 25, t1t_1 is not divisible by 11,13,17,1911, 13, 17, 19 or 2323. Otherwise d15<24d_{15} < 24. This shows that γ2\gamma \ge 2 and d17d_{17} cannot be equal to 26=21326 = 2 \cdot 13 nor be equal to 27=3327 = 3^3. Since 44 and 77 are divisors of nn, it follows that 28=4728 = 4 \cdot 7 also divides nn. Hence d17=28d_{17} = 28.

Case 2: Suppose d7=8d_7 = 8. Then
(d16d15)(d16+d15)=64=2×32=4×16 (d_{16} - d_{15}) (d_{16} + d_{15}) = 64 = 2 \times 32 = 4 \times 16
so that d16=17,d15=15d_{16} = 17, d_{15} = 15 or d16=10,d15=6d_{16} = 10, d_{15} = 6. Since d6=6d_6 = 6, we can immediately rule out d15=6d_{15} = 6. If d7=8d_7 = 8 and d15=15d_{15} = 15, then
8=d7<d8<d9<d10<d11<d12<d13<d14<d15=15, 8 = d_7 < d_8 < d_9 < d_{10} < d_{11} < d_{12} < d_{13} < d_{14} < d_{15} = 15,
which is impossible.

Case 3: If d7=9d_7 = 9, then
(d16d15)(d16+d15)=81=1×81=3×27. (d_{16} - d_{15}) (d_{16} + d_{15}) = 81 = 1 \times 81 = 3 \times 27.
We get d16=41,d15=40d_{16} = 41, d_{15} = 40 or d16=15,d15=12d_{16} = 15, d_{15} = 12.
Since
9=d7<d8<<d15, 9 = d_7 < d_8 < \dots < d_{15},
we may rule out d15=12d_{15} = 12. If d15=40d_{15} = 40, then 4040 divides nn and hence 88 also divides nn. But d6=6d_6 = 6 and d7=9d_7 = 9 and 88 cannot be a divisor of nn.

Case 4: Suppose d7=10d_7 = 10. In this case
(d16d15)(d16+d15)=100=2×50 (d_{16} - d_{15}) (d_{16} + d_{15}) = 100 = 2 \times 50
and hence d16=26,d15=24d_{16} = 26, d_{15} = 24. This shows 8n8|n. But then d6=6,d10=10d_6 = 6, d_{10} = 10 is impossible. We conclude that the only possible value is d17=28d_{17} = 28.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.