Maths Olympiad Prep

Library / /483 of 520

Number theory Difficulty 7.7 National olympiad, round 2 Prove it

For any positive integers x,y,zx,y,z and w,w, prove that x2,y2,z2x^2,y^2,z^2 and w2w^2 cannot be four consecutive terms of arithmetic sequence.

Solution

1. Suppose there exist positive integers x,y,z,w x, y, z, w (with x<y<z<w x < y < z < w ) such that x2,y2,z2,w2 x^2, y^2, z^2, w^2 are four consecutive terms of an arithmetic sequence. We consider such x,y,z,w x, y, z, w such that x2+y2+z2+w2 x^2 + y^2 + z^2 + w^2 is minimized.
2. Since x2,y2,z2,w2 x^2, y^2, z^2, w^2 are in arithmetic progression, there exists a common difference d d such that:
y2=x2+d,z2=y2+d,w2=z2+d y^2 = x^2 + d, \quad z^2 = y^2 + d, \quad w^2 = z^2 + d
This implies:
z2=x2+2dandw2=x2+3d z^2 = x^2 + 2d \quad \text{and} \quad w^2 = x^2 + 3d
3. From y2=x2+d y^2 = x^2 + d and z2=y2+d z^2 = y^2 + d , we get:
2y2=x2+z2 2y^2 = x^2 + z^2
Similarly, from z2=y2+d z^2 = y^2 + d and w2=z2+d w^2 = z^2 + d , we get:
2z2=y2+w2 2z^2 = y^2 + w^2
4. Since x,y,z,w x, y, z, w are positive integers, x,y,z,w x, y, z, w must all be odd. This is because if any of them were even, the equations 2y2=x2+z2 2y^2 = x^2 + z^2 and 2z2=y2+w2 2z^2 = y^2 + w^2 would not hold for integers.
5. We can express y y and z z in terms of x x and w w :
y=x+z2andz=y+w2 y = \frac{x + z}{2} \quad \text{and} \quad z = \frac{y + w}{2}
6. Therefore, there exist integers m,n m, n such that:
y=m2+n2,z+x2=m2n2,zx2=2mn y = m^2 + n^2, \quad \frac{z + x}{2} = m^2 - n^2, \quad \frac{z - x}{2} = 2mn
and integers p,q p, q such that:
z=p2+q2,w+y2=p2q2,wy2=2pq z = p^2 + q^2, \quad \frac{w + y}{2} = p^2 - q^2, \quad \frac{w - y}{2} = 2pq
7. From the minimality of x2+y2+z2+w2 x^2 + y^2 + z^2 + w^2 , we can see that y,z+x2, y, \frac{z + x}{2}, etc., are coprime. Therefore:
y=m2+n2=p2q22pq,z=m2n2+2mn=p2+q2 y = m^2 + n^2 = |p^2 - q^2 - 2pq|, \quad z = m^2 - n^2 + 2mn = p^2 + q^2
8. Case 1: y=m2+n2=p2q22pq y = m^2 + n^2 = p^2 - q^2 - 2pq
z+y2=m2+mn=p2pqp2m2=mn+pq \frac{z + y}{2} = m^2 + mn = p^2 - pq \quad \Rightarrow \quad p^2 - m^2 = mn + pq
zy2=mnn2=q2+pqq2+n2=mnpq \frac{z - y}{2} = mn - n^2 = q^2 + pq \quad \Rightarrow \quad q^2 + n^2 = mn - pq
This leads to:
(p2m2)(q2+n2)=m2n2p2q2 (p^2 - m^2)(q^2 + n^2) = m^2 n^2 - p^2 q^2
which simplifies to:
p2(n2+2q2)=m2(2n2+q2) p^2 (n^2 + 2q^2) = m^2 (2n^2 + q^2)
Assuming gcd(m,p)=gcd(n,q)=1 \gcd(m, p) = \gcd(n, q) = 1 , we have:
gcd(n2+2q2,2n2+q2)=1 or 3 \gcd(n^2 + 2q^2, 2n^2 + q^2) = 1 \text{ or } 3
If gcd(n2+2q2,2n2+q2)=1 \gcd(n^2 + 2q^2, 2n^2 + q^2) = 1 , then:
p2=2n2+q2,m2=n2+2q2 p^2 = 2n^2 + q^2, \quad m^2 = n^2 + 2q^2
This implies 3p2+m2 3 \mid p^2 + m^2 , so 3p,m 3 \mid p, m , which contradicts gcd(m,p)=1 \gcd(m, p) = 1 .

If gcd(n2+2q2,2n2+q2)=3 \gcd(n^2 + 2q^2, 2n^2 + q^2) = 3 , then:
3p2=2n2+q2,3m2=n2+2q2 3p^2 = 2n^2 + q^2, \quad 3m^2 = n^2 + 2q^2
This implies n2,p2,m2,q2 n^2, p^2, m^2, q^2 are four consecutive terms of an arithmetic sequence, which contradicts the minimality of x2+y2+z2+w2 x^2 + y^2 + z^2 + w^2 .

9. Case 2: y=m2+n2=2pqp2+q2 y = m^2 + n^2 = 2pq - p^2 + q^2
z+y2=m2+mn=pq+q2 \frac{z + y}{2} = m^2 + mn = pq + q^2
zy2=mnn2=p2pq \frac{z - y}{2} = mn - n^2 = p^2 - pq
This leads to:
(q2m2)(p2+n2)=m2n2p2q2 (q^2 - m^2)(p^2 + n^2) = m^2 n^2 - p^2 q^2
which simplifies to:
m2(p2+2n2)=q2(2p2+n2) m^2 (p^2 + 2n^2) = q^2 (2p^2 + n^2)
From then on, we proceed in the same way as in Case 1, finishing the proof.

\blacksquare

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.