Number theoryDifficulty 5.1AIME, harderProve itSilk Road Mathematics Competition
Prove that for every prime number p there exists infinitely many 4-tuples (x,y,z,t) of pairwisely distinct positive integers such that the number (x2+pt2)(y2+pt2)(z2+pt2) is a square of an integer.
Solution
Firstly, note that the equation x2−py2=1 has infinitely many solutions in positive integers. (Pell's equation) Then for every prime number p there exist infinitely many positive integers s and t such that s2−1=pt2. Putting x=s2−1, y=s+1, z=s−1 we have (x2+s2−1)(y2+s2−1)(z2+s2−1)==(s2−1)s2(s+1)(2s)(s−1)(2s)=((s2−1)2s2)2. It is remained to check that x,y,z=t. Note that x=s2−1=pt2=t. If y=s+1=t then (s−1)(s+1)=pt2=p(s+1)2⇒s−1=p(s+1)>s+1>s−1. If z=s−1=t, then (s−1)(s+1)=pt2=p(s−1)2⇒s+1=p(s−1)≥2(s−1)>s+1, for s>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 reproduced verbatim; metadata (topic, difficulty) added by this project.