Maths Olympiad Prep

Library / /4 of 16

Number theory Difficulty 5.4 AIME, harder Prove it United States

Problem:
Let kk be a positive integer. Prove that there exist integers xx and yy, neither of which is divisible by 33, such that x2+2y2=3kx^{2} + 2y^{2} = 3^{k}.

Solution

Solution:
For the first several values of kk it is straightforward to find solutions xkx_{k} and yky_{k} satisfying xk2+2yk2=3kx_{k}^{2} + 2y_{k}^{2} = 3^{k}, leading to this table of solutions.

kkxkx_{k}yky_{k}
111
212
351
474
5111

The key is to realize that negating any value of xkx_{k} or yky_{k} also yields a solution, so we may recast the table as follows.
kkxkx_{k}yky_{k}
1-1-1
21-2
35-1
474
5-111

It is now apparent that we should take xk+1=xk2ykx_{k+1} = x_{k} - 2y_{k} and yk+1=xk+yky_{k+1} = x_{k} + y_{k}. One then confirms that
xk+12+2yk+12=(xk24xkyk+4yk2)+2(xk2+2xkyk+yk2)=3(xk2+2yk2), \begin{aligned} x_{k+1}^{2} + 2y_{k+1}^{2} &= (x_{k}^{2} - 4x_{k}y_{k} + 4y_{k}^{2}) + 2(x_{k}^{2} + 2x_{k}y_{k} + y_{k}^{2}) \\ &= 3(x_{k}^{2} + 2y_{k}^{2}), \end{aligned}
from which it easily follows by induction that xk2+2yk2=3kx_{k}^{2} + 2y_{k}^{2} = 3^{k} for all k1k \geq 1. Finally, one can also show by induction that xkyk(1)kmod3x_{k} \equiv y_{k} \equiv (-1)^{k} \bmod 3, hence none of the xkx_{k} or yky_{k} are divisible by 33.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.