Maths Olympiad Prep

Library / /2 of 4

Number theory Difficulty 6.0 National Olympiad Prove it Italy

Problem:

a. Determine all pairs (x,k)(x, k) of positive integers satisfying the equation
3k1=x3. 3^{k}-1=x^{3}.

b. Prove that if nn is an integer greater than 1 and different from 3, there are no pairs (x,k)(x, k) of positive integers satisfying the equation
3k1=xn. 3^{k}-1=x^{n}.

Solution

Solution:

a. We rewrite the equation in the form
3k=x3+1=(x+1)(x2x+1) 3^{k}=x^{3}+1=(x+1)\left(x^{2}-x+1\right)
Since the only divisors of a power of 3 are themselves powers of 3, every solution must satisfy the system
{x+1=3ax2x+1=3b \left\{\begin{array}{l} x+1=3^{a} \\ x^{2}-x+1=3^{b} \end{array}\right.
with aa and bb positive integers such that a+b=ka+b=k. If a=1a=1, we get x=2,b=1x=2, b=1 and (x,k)=(2,2)(x, k)=(2,2) is a solution. If a>1a>1, substituting x=3a1x=3^{a}-1 into the second equation gives
32a3a+1+3=3(32a13a+1)=3b 3^{2 a}-3^{a+1}+3=3\left(3^{2 a-1}-3^{a}+1\right)=3^{b}
which is impossible because 32a13a+13^{2 a-1}-3^{a}+1 is greater than 1 and is not divisible by 3. Therefore there is a unique solution, (x,k)=(2,2)(x, k)=(2,2).

b. Suppose first that nn is an odd number. We can write the equation in the form
3k=xn+1=(x+1)(xn1xn2+x+1) 3^{k}=x^{n}+1=(x+1)\left(x^{n-1}-x^{n-2}+\cdots-x+1\right)
and, similarly to before, any solution should satisfy the system
{x+1=3axn1xn2+x+1=3b \left\{\begin{array}{l} x+1=3^{a} \\ x^{n-1}-x^{n-2}+\cdots-x+1=3^{b} \end{array}\right.
with aa and bb positive integers such that a+b=ka+b=k. Dividing the polynomial xn1xn2+x+1x^{n-1}-x^{n-2}+\cdots-x+1 by x+1x+1 we get
xn1xn2+x+1=q(x)(x+1)+r x^{n-1}-x^{n-2}+\cdots-x+1=q(x)(x+1)+r
and, setting x=1x=-1, we obtain r=nr=n. Hence the greatest common divisor between x+1x+1 and xn1xn2+x+1x^{n-1}-x^{n-2}+\cdots-x+1, which is a power of 3 with positive exponent, must also divide nn, and hence in particular 3 must be a divisor of nn. Setting n=3m,xm=yn=3 m, x^{m}=y, our equation becomes
3k1=y3 3^{k}-1=y^{3}
From case (a) we know that the only solution is y=2,k=2y=2, k=2. But xm=2x^{m}=2 clearly has no integer solutions for m>1m>1.

Finally suppose n=2mn=2 m is even, and, setting xm=yx^{m}=y, consider the equation
3k=x2m+1=y2+1 3^{k}=x^{2 m}+1=y^{2}+1
Considering all possible remainders of the division of yy by 3, namely the cases y=3z,3z+1,3z1y=3 z, 3 z+1, 3 z-1, we see that y2+1y^{2}+1 is never divisible by 3, and hence there are no solutions.

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 translated into English from it; metadata (topic, difficulty) added by this project.