Maths Olympiad Prep

Library / /3 of 8

Number theory Difficulty 5.0 AIME, harder Prove it Ukraine

Find all pairs of prime numbers (p,q)(p, q) with p>qp > q, for which both numbers p+qp+q and pqp-q are also prime.

Solution

For the number p+qp+q to be prime the numbers pp and qq must be of different parity, which automatically means that q=2q=2, since p>qp > q. By the problem statement we then have that the numbers p2,pp-2, p, and p+2p+2 should be prime. Since they obviously have different remainders in division by 33, one of them must be equal to 33. So we have three possibilities:
* If p2=3p-2=3, then p=5p=5, p+2=7p+2=7, and the pair (5;2)(5; 2) satisfies the problem statement;

* if p=3p=3, then p2=1p-2=1, and is not prime;
* if p+2=3p+2=3, then p=1p=1, and is not prime.
So after considering all possible cases we end up with a single solution p=5,q=2p=5, q=2.

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.