Maths Olympiad Prep

Library / Junior Balkan Mathematical Olympiad /61 of 95

Junior Balkan Mathematical Olympiad

Number theory Difficulty 6.2 National Olympiad Prove it JBMO

Problem:

If the positive integers xx and yy are such that both 3x+4y3x + 4y and 4x+3y4x + 3y are perfect squares, prove that both xx and yy are multiples of 77.

Solution

Solution:

Let
3x+4y=m2,4x+3y=n2 3x + 4y = m^2, \quad 4x + 3y = n^2
Then
7(x+y)=m2+n2⇒7∣m2+n2 7(x + y) = m^2 + n^2 \Rightarrow 7 \mid m^2 + n^2
Considering m=7k+rm = 7k + r, r∈{0,1,2,3,4,5,6}r \in \{0, 1, 2, 3, 4, 5, 6\}, we find that m2≡u(mod7)m^2 \equiv u \pmod{7}, u∈{0,1,2,4}u \in \{0, 1, 2, 4\} and similarly n2≡v(mod7)n^2 \equiv v \pmod{7}, v∈{0,1,2,4}v \in \{0, 1, 2, 4\}. Therefore, we have either m2+n2≡0(mod7)m^2 + n^2 \equiv 0 \pmod{7}, when u=v=0u = v = 0, or m2+n2≡w(mod7)m^2 + n^2 \equiv w \pmod{7}, w∈{1,2,3,4,5,6}w \in \{1, 2, 3, 4, 5, 6\}.

However, from (2) we have that m2+n2≡0(mod7)m^2 + n^2 \equiv 0 \pmod{7} and hence u=v=0u = v = 0 and
m2+n2≡0(mod72)⇒7(x+y)≡0(mod72) m^2 + n^2 \equiv 0 \pmod{7^2} \Rightarrow 7(x + y) \equiv 0 \pmod{7^2}
and consequently
x+y≡0(mod7) x + y \equiv 0 \pmod{7}
Moreover, from (1) we have x−y=n2−m2x - y = n^2 - m^2 and n2−m2≡0(mod7)n^2 - m^2 \equiv 0 \pmod{7} (since u=v=0u = v = 0), so
x−y≡0(mod7) x - y \equiv 0 \pmod{7}
From (3) and (4) we have that x+y=7kx + y = 7k, x−y=7lx - y = 7l, where kk and ll are positive integers. Hence
2x=7(k+l),2y=7(k−l) 2x = 7(k + l), \quad 2y = 7(k - l)
where k+lk + l and k−lk - l are positive integers. It follows that 7∣2x7 \mid 2x and 7∣2y7 \mid 2y, and finally 7∣x7 \mid x and 7∣y7 \mid y.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.