Maths Olympiad Prep

Library / /138 of 520

Number theory Difficulty 6.0 AIME, harder Prove it

If the positive integers xx and yy are such that both 3x+4y3 x+4 y and 4x+3y4 x+3 y are perfect squares, prove that both xx and yy are multiples of 7.

Solution

Let

3x+4y=m2,4x+3y=n2 3 x+4 y=m^{2}, \quad 4 x+3 y=n^{2}

Then

7(x+y)=m2+n27m2+n2 7(x+y)=m^{2}+n^{2} \Rightarrow 7 \mid m^{2}+n^{2}

Considering m=7k+r,r{0,1,2,3,4,5,6}m=7 k+r, \quad r \in\{0,1,2,3,4,5,6\} we find that m2u(mod7),um^{2} \equiv u(\bmod 7), \quad u \in {0,1,2,4}\{0,1,2,4\} and similarly n2v(mod7),v{0,1,2,4}n^{2} \equiv v(\bmod 7), \quad v \in\{0,1,2,4\}. Therefore we have either m2+n20(mod7)m^{2}+n^{2} \equiv 0 \quad(\bmod 7), when u=v=0u=v=0, or m2+n2w(mod7),w{1,2,3,4,5,6}m^{2}+n^{2} \equiv w(\bmod 7), w \in\{1,2,3,4,5,6\}. However, from (2) we have that m2+n20(mod7)m^{2}+n^{2} \equiv 0(\bmod 7) and hence u=v=0u=v=0 and

m2+n20(mod72)7(x+y)0(mod72) m^{2}+n^{2} \equiv 0 \quad\left(\bmod 7^{2}\right) \Rightarrow 7(x+y) \equiv 0 \quad\left(\bmod 7^{2}\right)

and consequently

x+y0(mod7) x+y \equiv 0 \quad(\bmod 7)

Moreover, from (1) we have xy=n2m2x-y=n^{2}-m^{2} and n2m20(mod72)n^{2}-m^{2} \equiv 0\left(\bmod 7^{2}\right) (since u=v=0u=v=0), so

xy0(mod7). x-y \equiv 0 \quad(\bmod 7) .

From (3) and (4) we have that x+y=7k,xy=7lx+y=7 k, x-y=7 l, where kk and ll are positive integers. Hence

2x=7(k+l),2y=7(kl) 2 x=7(k+l), 2 y=7(k-l)

where k+lk+l and klk-l are positive integers. It follows that 72x7 \mid 2 x and 72y7 \mid 2 y, and finally 7x7 \mid x and 7y7 \mid y.

## ALGEBRA

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.