Maths Olympiad Prep

Library / /5 of 29

Number theory Difficulty 5.1 AIME, harder Prove it Silk Road Mathematics Competition

Prove that for every prime number pp there exists infinitely many 4-tuples (x,y,z,t)(x, y, z, t) of pairwisely distinct positive integers such that the number
(x2+pt2)(y2+pt2)(z2+pt2) (x^2 + pt^2)(y^2 + pt^2)(z^2 + pt^2)
is a square of an integer.

Solution

Firstly, note that the equation x2py2=1x^2 - py^2 = 1 has infinitely many solutions in positive integers. (Pell's equation)
Then for every prime number pp there exist infinitely many positive integers ss and tt such that s21=pt2s^2 - 1 = pt^2.
Putting x=s21x = s^2 - 1, y=s+1y = s + 1, z=s1z = s - 1 we have
(x2+s21)(y2+s21)(z2+s21)==(s21)s2(s+1)(2s)(s1)(2s)=((s21)2s2)2. (x^2 + s^2 - 1)(y^2 + s^2 - 1)(z^2 + s^2 - 1) = \\ = (s^2 - 1)s^2(s + 1)(2s)(s - 1)(2s) = ((s^2 - 1)2s^2)^2.
It is remained to check that x,y,ztx, y, z \ne t.
Note that x=s21=pt2tx = s^2 - 1 = pt^2 \ne t.
If y=s+1=ty = s + 1 = t then
(s1)(s+1)=pt2=p(s+1)2s1=p(s+1)>s+1>s1. (s-1)(s+1) = pt^2 = p(s+1)^2 \Rightarrow s-1 = p(s+1) > s+1 > s-1.
If z=s1=tz = s - 1 = t, then
(s1)(s+1)=pt2=p(s1)2s+1=p(s1)2(s1)>s+1, (s-1)(s+1) = pt^2 = p(s-1)^2 \Rightarrow s+1 = p(s-1) \ge 2(s-1) > s+1,
for s>3s > 3.

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 and solution reproduced as published; topic and difficulty added by this site.