Maths Olympiad Prep

Library / /27 of 91

, 2010

Number theory Difficulty 5.5 AIME, harder Prove it India

Prove that there are infinitely many positive integers mm for which there exist consecutive odd positive integers pm,qmp_m, q_m (pm+2\equiv p_m + 2) such that the pairs (pm,qm)(p_m, q_m) are all distinct and
pm2+pmqm+qm2,pm2+mpmqm+qm2 p_m^2 + p_m q_m + q_m^2, \quad p_m^2 + m p_m q_m + q_m^2
are both perfect squares.

Solution

Consider the relations p2+pq+q2=u2p^2 + p q + q^2 = u^2 and p2+mpq+q2=v2p^2 + m p q + q^2 = v^2. Thus (m1)pq=(vu)(v+u)(m - 1) p q = (v - u)(v + u). Suppose we choose m1=r2m - 1 = r^2 where rr is a positive integer and vu=rpv - u = r p and v+u=rqv + u = r q. Then u=(rqrp)/2u = (r q - r p)/2 and 4(p2+pq+q2)=(rqrp)24(p^2 + p q + q^2) = (r q - r p)^2. This leads to
(r24)p2(2r2+4)pq+(r24)q2=0. (r^2 - 4) p^2 - (2 r^2 + 4) p q + (r^2 - 4) q^2 = 0.
Solving for p/qp/q, we get
pq=2r2+4±4(r2+2)24(r24)22(r24). \frac{p}{q} = \frac{2 r^2 + 4 \pm \sqrt{4(r^2 + 2)^2 - 4(r^2 - 4)^2}}{2(r^2 - 4)}.
We want the discriminant to be a perfect square. This forces 3(r21)3(r^2 - 1) to be a perfect square, which leads to the Pell's equation r23t2=1r^2 - 3 t^2 = 1. The equation has infinitely many solutions (rn,tn)(r_n, t_n) given by
rn+tn3=(2+3)n. r_n + t_n \sqrt{3} = (2 + \sqrt{3})^n.
We also have recurrence relations:
rn+1=2rn+3tn,tn+1=rn+2tn, r_{n+1} = 2 r_n + 3 t_n, \quad t_{n+1} = r_n + 2 t_n,
where r1=2r_1 = 2 and t1=1t_1 = 1. Induction shows that t2lt_{2l} is even for all l1l \ge 1. We can express p/qp/q in terms of tt:
pq=(t±1)2t21=t+1t1 or t1t+1. \frac{p}{q} = \frac{(t \pm 1)^2}{t^2 - 1} = \frac{t + 1}{t - 1} \text{ or } \frac{t - 1}{t + 1}.
Take m=r2l2+1m = r_{2l}^2 + 1, pm=t2l1p_m = t_{2l} - 1, qm=t2l+1q_m = t_{2l} + 1; we see that pl,qlp_l, q_l are consecutive odd integers. Moreover,
pm2+pmqm+qm2=r2l2,pm2+mpmqm+qm2=(t2lr2l)2. \begin{align*} p_m^2 + p_m q_m + q_m^2 &= r_{2l}^2, \\ p_m^2 + m p_m q_m + q_m^2 &= (t_{2l} r_{2l})^2. \end{align*}
This proves our claim.

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.