Olympiad Maths Prep

Library / /5 of 33

Number theory Difficulty 5.6 AIME, harder Prove it Belarus

Solve the equation 2a5b=32^a - 5^b = 3 in positive integers a,ba, b.

Solution

Answer: (a;b)=(3;1)(a; b) = (3; 1) or (7;3)(7; 3).

(Solution by Y. Dubovik.) Note that if a7a \le 7 or b3b \le 3, then it is easy to verify that the only solutions are (a;b)=(3;1)(a; b) = (3; 1) and (a;b)=(7;3)(a; b) = (7; 3).

Now it remains to prove that there are no solutions with a>7,b>3a > 7, b > 3. In this case we can write a=7+α,b=3+βa = 7 + \alpha, b = 3 + \beta, where α,βN\alpha, \beta \in \mathbb{N}. Then the given equation 27+α53+β=32^{7+\alpha} - 5^{3+\beta} = 3 transforms to
27(2α1)=53(5β1).(1) 2^7(2^\alpha - 1) = 5^3(5^\beta - 1). \qquad (1)
Suppose that (1) has a solution (α;β)(\alpha; \beta) in positive integers. Set A=27(2α1)=53(5β1)A = 2^7(2^\alpha - 1) = 5^3(5^\beta - 1).

1. From (1) it follows that A27A \supseteq 2^7, so 5β1(mod27)5^\beta \equiv 1 \pmod{2^7}. One can easily deduce that β32\beta \supseteq 32.

2. Also, A53A \supseteq 5^3, so 2α1(mod125)2^\alpha \equiv 1 \pmod{125} and we deduce that α100\alpha \supseteq 100. In particular, A(21001)A \supseteq (2^{100} - 1), and so A(251)=31A \supseteq (2^5 - 1) = 31. It follows that 5β1315^\beta - 1 \supseteq 31, thus β3\beta \supseteq 3.

3. Thus we have β96\beta \supseteq 96, whence A(5961)A \supseteq (5^{96} - 1), so A97A \supseteq 97, which implies 2α1(mod97)2^\alpha \equiv 1 \pmod{97}. Therefore, α48\alpha \supseteq 48. In particular, A(2481)A \supseteq (2^{48} - 1), then A(2161)A \supseteq (2^{16} - 1) and A(28+1)=257A \supseteq (2^8 + 1) = 257.

4. Finally, 5β12575^\beta - 1 \supseteq 257, which gives β256\beta \supseteq 256, whence A28A \supseteq 2^8, contrary to (1).

Looking for a route rather than 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 and solution reproduced as published; topic and difficulty added by this site.