Maths Olympiad Prep

Library / /9 of 15

Number theory Difficulty 5.4 AIME, harder Prove it Romania

Find all primes pp, qq, rr such that p(p7)+q(q7)=r(r7)p(p-7) + q(q-7) = r(r-7).

Solution

The given equality rewrites as p2+q2r2=7(p+qr)p^2 + q^2 - r^2 = 7(p + q - r). Since (p+qr)(p+qr)=p2+q2r2+2pq(p+q-r)(p+q-r) = p^2 + q^2 - r^2 + 2pq, it follows that p+qrp+q-r divides 2pq2pq.
If pp, qq, r>2r > 2, then p+qrp+q-r is odd, so p+qr=pp+q-r = p, qq or pqpq. The first case gives r=qr = q, then p=7p = 7, so (p,q,r)=(7,q,q)(p, q, r) = (7, q, q), qq being an arbitrary prime. Likewise, the second case gives (p,q,r)=(p,7,p)(p, q, r) = (p, 7, p), pp being an arbitrary prime. If p+qr=pqp+q-r = pq, then 1r=(p1)(q1)1-r = (p-1)(q-1), impossible.
If p=2p=2 (or q=2q=2) the equality becomes (qr)(q+r7)=10(q-r)(q+r-7) = 10, implying q=7q=7 and r=5r=5, with two new solutions obtained, (p,q,r)=(2,7,5)(p, q, r) = (2, 7, 5) and (p,q,r)=(7,2,5)(p, q, r) = (7, 2, 5), or r=2r=2, with no further solutions obtained.
The solution triplets therefore are (2,7,5)(2, 7, 5), (7,2,5)(7, 2, 5), (7,t,t)(7, t, t), (t,7,t)(t, 7, t), where tt is an arbitrary prime. (Notice the fact rr was known to be a prime turned out to be inconsequential).

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.