Maths Olympiad Prep

Track / Stage 6 / 63 of 400 #1543 of 2444

Problem 1543

National Olympiad, first round
Number theory Difficulty 6.0 Prove it Italy competition problems · Italy

Determine all pairs of positive integers (a,n)\left(a, n\right) with an2a \geq n \geq 2 for which the number (a+1)n+a1(a+1)^{n}+a-1 is a power of 22.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:

If we expand (a+1)n+a1(a+1)^{n}+a-1 using the binomial theorem, we get:
an++n(n1)2a2+na+1+a1=an++n(n1)2a2+(n+1)a. a^{n}+\cdots+\frac{n(n-1)}{2} a^{2}+n a+1+a-1=a^{n}+\cdots+\frac{n(n-1)}{2} a^{2}+(n+1) a.
Thus, since all the terms are divisible by aa, and since (a+1)n+a1(a+1)^{n}+a-1 is a power of 22, aa is also a power of 22. Let us call a=2ba=2^{b} and (a+1)n+a1=2c(a+1)^{n}+a-1=2^{c}. From the condition a2a \geq 2 we obtain b1b \geq 1. Moreover, from the condition n2n \geq 2 we also obtain that 2c>a2=22b2^{c}>a^{2}=2^{2b}, and hence c>2bc>2b.
Observe that all the terms in ()(\star), except possibly the last one, are divisible by a2=22ba^{2}=2^{2b}.
Since c>2b,2cc>2b, 2^{c} is divisible by 22b2^{2b}, and hence, by difference, so is (n+1)a(n+1) a. Since a=2ba=2^{b}, it follows that 2b2^{b} divides n+1n+1, that is, n+1=2bm=amn+1=2^{b} \cdot m=a m for some positive integer mm. From the condition an2a \geq n \geq 2, the only possible value for mm is m=1m=1, and hence n=a1=2b1n=a-1=2^{b}-1. In particular, bb cannot take the value 11, otherwise n=1n=1, and hence b>1b>1, from which a4a \geq 4 and n=a13n=a-1 \geq 3. From this last inequality it follows that 2c>a32^{c}>a^{3}, and hence c>3bc>3b.
Let us rewrite (a+1)n+a1(a+1)^{n}+a-1 using the information we have gathered:
(a+1)n+a1=an++n(n1)(n2)6a3+n(n1)2a2+(n+1)a==2nb++(2b1)(2b2)(2b3)623b+(2b1)(2b2)222b+22b \begin{aligned} (a+1)^{n}+a-1 & =a^{n}+\cdots+\frac{n(n-1)(n-2)}{6} a^{3}+\frac{n(n-1)}{2} a^{2}+(n+1) a= \\ & =2^{nb}+\cdots+\frac{\left(2^{b}-1\right)\left(2^{b}-2\right)\left(2^{b}-3\right)}{6} 2^{3b}+\frac{\left(2^{b}-1\right)\left(2^{b}-2\right)}{2} 2^{2b}+2^{2b} \end{aligned}
All the terms, except possibly the last two, are divisible by 23b2^{3b}; moreover 2c2^{c} is also divisible by 23b2^{3b}, and hence so is (2b1)(2b2)222b+22b=(2b1)(2b11)22b+22b\frac{\left(2^{b}-1\right)\left(2^{b}-2\right)}{2} 2^{2b}+2^{2b}=\left(2^{b}-1\right)\left(2^{b-1}-1\right) 2^{2b}+2^{2b}.
It follows that (2b1)(2b11)+1=22b12b2b1+2\left(2^{b}-1\right)\left(2^{b-1}-1\right)+1=2^{2b-1}-2^{b}-2^{b-1}+2 is divisible by 2b2^{b}, but this is possible only when b=2b=2: if b>2b>2, in fact, all the terms of the expression except the last one are divisible by 44, and hence the sum is not divisible by 44 (and hence not by 2b2^{b} either).
The only remaining case is b=2b=2, from which a=4a=4 and n=3n=3. In this case, an elementary check shows that (a+1)n+a1=128=27(a+1)^{n}+a-1=128=2^{7}, so this is a solution.
In conclusion, there is a unique solution: a=4,n=3a=4, n=3.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from it; metadata (topic, difficulty, ordering) added by this project.