Maths Olympiad Prep

Library / Team Selection Test for IMO /10 of 55

Team Selection Test for IMO, 2024

Number theory Difficulty 7.7 National Olympiad, round 2 Prove it Turkey

Find all pairs of positive integers (a,b)(a, b) such that
10a−3b+12a \frac{10^{a} - 3^{b} + 1}{2^{a}}
is a perfect square.

Solution

Answer: (a,b)=(1,1)(a, b) = (1, 1) and (1,2)(1, 2).
Assume that
10a−3b+12a=m2 \frac{10^{a} - 3^b + 1}{2^a} = m^2
holds for some integer mm. Let us rewrite the equation as
3b=10a−m22a+1. 3^b = 10^{a} - m^2 2^a + 1.
If a=1a=1 then clearly the only solutions are (a,b)=(1,1)(a, b) = (1, 1) and (1,2)(1, 2). If a≥2a \ge 2 then aa is even. Then, since 33 divides 10a−m22a+110^{a} - m^2 2^a + 1, we get m22a≡2(mod3)m^2 2^a \equiv 2 \pmod{3} which means that aa is odd. If a=3a=3 then by using modulo 44 we get that bb is even. Since 106+1=36+m22a=c2+2d210^6 + 1 = 3^6 + m^2 2^a = c^2 + 2d^2, we have no integer solutions because −2-2 is not a quadratic residue modulo 101101 and 101∤3b/2101 \nmid 3^{b/2}. Therefore, a≥5a \ge 5. In that case, by using modulo 1616 we get that 4∣b4 \mid b and hence 5∣3b−15 \mid 3^b - 1. Then 5∣m5 \mid m and hence 25∣3b−125 \mid 3^b - 1. Let b=4kb=4k, then 25∣81k−125 \mid 81^k - 1 and from the LTE lemma,
v5(81k−1)=v5(80)+v5(k)≥2 v_5(81^k - 1) = v_5(80) + v_5(k) \ge 2
and hence 5∣k5 \mid k, which implies 5∣b5 \mid b. Hence 3b≡1(mod11)3^b \equiv 1 \pmod{11} and 11∣10a−m22a=x2−2y211 \mid 10^{a} - m^2 2^a = x^2 - 2y^2 but 22 is not a quadratic residue modulo 1111 so we must have 11∣10a/211 \mid 10^{a/2}, which is a contradiction. Thus, there is no solution for a≥2a \ge 2.

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.