Find all primes p and q, with p≤q, so that p(2q+1)+q(2p+1)=2(p2+q2).
Solution
The equality can be written p+q=2(p−q)2, which shows that p is odd. If p≥5, then p and q leave remainder 1 or 2 when divided by 3. We will show that in this case the equality is impossible. Indeed, if p and q leave the same remainder mod 3, then 3∣2(p−q)2 and 3∤p+q; if p and q leave different remainders, then 3∤2(p−q)2 and 3∣p+q. Finally, if p=3, then q=5.
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.