Maths Olympiad Prep

Library / /2 of 7

Number theory Difficulty 5.3 AIME, harder Prove it Austria

Let pp, qq, rr and ss be prime numbers satisfying
5<p<q<r<s<p+10. 5 < p < q < r < s < p + 10.
Prove that the sum of these four prime numbers is divisible by 60.

Solution

The four prime numbers have to fulfill p>5p > 5 and s<p+10s < p + 10 and hence they must be among the five consecutive odd numbers pp, p+2p + 2, p+4p + 4, p+6p + 6 and p+8p + 8.
As we have to choose 4 out of the five numbers pp, p+2p + 2, p+4p + 4, p+6p + 6, p+8p + 8, we have to omit exactly one of these numbers. If we omit one of the numbers pp, p+2p + 2, p+6p + 6 or p+8p + 8, three subsequent odd numbers remain, one of which has to be divisible by 3, which is excluded.
Therefore, we have to omit p+4p + 4.
Hence the four prime numbers have to be pp, q=p+2q = p + 2, r=p+6r = p + 6 and s=p+8s = p + 8.
Exactly one of the five consecutive integers pp, p+2p+2, p+4p+4, p+6p+6 and p+8p+8 is divisible by 5.
By construction, none of the chosen number pp, qq, rr, ss can be divisible by 5. This implies that p+4p+4 is divisible by 5. So p+4p+4 is divisible by 15.
The fact that
p+q+r+s=p+(p+2)+(p+6)+(p+8)=4p+16=4(p+4) p + q + r + s = p + (p + 2) + (p + 6) + (p + 8) = 4p + 16 = 4(p + 4)
yields that the sum is divisible by 60.

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.