Maths Olympiad Prep

Track / Stage 7 / 149 of 300 #1549 of 1964

Problem 1549

National olympiad second round; IMO P1/P4
Number theory Difficulty 7.3 Prove it

Let p,q,rp, q, r and ss be four prime numbers such that 5<p<q<r<s<p+10.5 <p <q <r <s <p + 10.
Prove that the sum of the four prime numbers is divisible by 6060.

(Walther Janous)

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

Given four prime numbers p,q,r,s p, q, r, s such that 5<p<q<r<s<p+10 5 < p < q < r < s < p + 10 , we need to prove that the sum of these four prime numbers is divisible by 60 60 .

1. Prime Number Properties:
- Note that any prime number greater than 3 can be expressed in the form 6k±1 6k \pm 1 for some integer k k . This is because any integer can be written as 6k,6k+1,6k+2,6k+3,6k+4, 6k, 6k+1, 6k+2, 6k+3, 6k+4, or 6k+5 6k+5 . Among these, 6k,6k+2,6k+3, 6k, 6k+2, 6k+3, and 6k+4 6k+4 are not primes (except for 2 and 3 themselves).

2. Case Analysis:
- We will consider two cases based on the form of p p .

Case 1: p=6k+1 p = 6k + 1
- If p=6k+1 p = 6k + 1 , then the possible values for q,r,s q, r, s within the range (p,p+10) (p, p+10) are:
p+2=6k+3,p+4=6k+5,p+6=6k+7,p+8=6k+9,p+10=6k+11 p+2 = 6k+3, \quad p+4 = 6k+5, \quad p+6 = 6k+7, \quad p+8 = 6k+9, \quad p+10 = 6k+11
- Among these, 6k+3 6k+3 and 6k+9 6k+9 are not primes. Therefore, the possible primes are 6k+5,6k+7, 6k+5, 6k+7, and 6k+11 6k+11 .
- However, 6k+11 6k+11 is not within the range (p,p+10) (p, p+10) . Thus, this case does not provide a valid set of four primes.

Case 2: p=6k+5 p = 6k + 5
- If p=6k+5 p = 6k + 5 , then the possible values for q,r,s q, r, s within the range (p,p+10) (p, p+10) are:
p+2=6k+7,p+4=6k+9,p+6=6k+11,p+8=6k+13,p+10=6k+15 p+2 = 6k+7, \quad p+4 = 6k+9, \quad p+6 = 6k+11, \quad p+8 = 6k+13, \quad p+10 = 6k+15
- Among these, 6k+9 6k+9 and 6k+15 6k+15 are not primes. Therefore, the possible primes are 6k+7,6k+11, 6k+7, 6k+11, and 6k+13 6k+13 .
- Thus, the primes are p=6k+5,q=6k+7,r=6k+11,s=6k+13 p = 6k+5, q = 6k+7, r = 6k+11, s = 6k+13 .

3. Sum of Primes:
- The sum of these primes is:
p+q+r+s=(6k+5)+(6k+7)+(6k+11)+(6k+13)=24k+36 p + q + r + s = (6k+5) + (6k+7) + (6k+11) + (6k+13) = 24k + 36
- We can factor out 12:
p+q+r+s=12(2k+3) p + q + r + s = 12(2k + 3)
- Therefore, p+q+r+s p + q + r + s is divisible by 12.

4. Divisibility by 5:
- Since p,q,r,s p, q, r, s are all primes greater than 5, they must be of the form 5m±1 5m \pm 1 for some integer m m .
- Considering the forms 6k+5,6k+7,6k+11,6k+13 6k+5, 6k+7, 6k+11, 6k+13 , we can see that:
p0(mod5),q2(mod5),r1(mod5),s3(mod5) p \equiv 0 \pmod{5}, \quad q \equiv 2 \pmod{5}, \quad r \equiv 1 \pmod{5}, \quad s \equiv 3 \pmod{5}
- Summing these congruences:
p+q+r+s0+2+1+361(mod5) p + q + r + s \equiv 0 + 2 + 1 + 3 \equiv 6 \equiv 1 \pmod{5}
- This shows that the sum is not divisible by 5, which contradicts our earlier assumption. Therefore, we need to re-evaluate the forms of p,q,r,s p, q, r, s .

5. Revised Analysis:
- Given the constraints, we need to ensure that the sum is divisible by both 12 and 5. The correct forms should be re-evaluated to ensure the sum is divisible by 60.

The final answer is 60 \boxed{60}

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.