Number theoryDifficulty 5.5AIME, harderProve itIndia
Prove that there are infinitely many positive integers m for which there exist consecutive odd positive integers pm,qm (≡pm+2) such that the pairs (pm,qm) are all distinct and pm2+pmqm+qm2,pm2+mpmqm+qm2 are both perfect squares.
Solution
Consider the relations p2+pq+q2=u2 and p2+mpq+q2=v2. Thus (m−1)pq=(v−u)(v+u). Suppose we choose m−1=r2 where r is a positive integer and v−u=rp and v+u=rq. Then u=(rq−rp)/2 and 4(p2+pq+q2)=(rq−rp)2. This leads to (r2−4)p2−(2r2+4)pq+(r2−4)q2=0. Solving for p/q, we get qp=2(r2−4)2r2+4±4(r2+2)2−4(r2−4)2. We want the discriminant to be a perfect square. This forces 3(r2−1) to be a perfect square, which leads to the Pell's equation r2−3t2=1. The equation has infinitely many solutions (rn,tn) given by rn+tn3=(2+3)n. We also have recurrence relations: rn+1=2rn+3tn,tn+1=rn+2tn, where r1=2 and t1=1. Induction shows that t2l is even for all l≥1. We can express p/q in terms of t: qp=t2−1(t±1)2=t−1t+1 or t+1t−1. Take m=r2l2+1, pm=t2l−1, qm=t2l+1; we see that pl,ql are consecutive odd integers. Moreover, pm2+pmqm+qm2pm2+mpmqm+qm2=r2l2,=(t2lr2l)2. 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.