Maths Olympiad Prep

Track / Stage 7 / 237 of 300 #1637 of 1964

Problem 1637

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

Let a,b,ca, b, c be natural numbers such that a+b+c=2pq(p30+q30),p>qa+b+c = 2pq(p^{30}+q^{30}), p > q being two given positive integers.
(a)(a) Prove that k=a3+b3+c3k = a^3 + b^3 + c^3 is not a prime number.
(b)(b) Prove that if abca\cdot b\cdot c is maximum, then 19841984 divides kk.

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

Let's break down the problem into two parts and provide a detailed solution for each.

### Part (a): Prove that k=a3+b3+c3 k = a^3 + b^3 + c^3 is not a prime number.

1. Given: a+b+c=2pq(p30+q30) a + b + c = 2pq(p^{30} + q^{30}) where p>q p > q are positive integers.
2. Observation: Since a,b,c a, b, c are natural numbers, a+b+c a + b + c is a natural number.
3. Sum of Cubes: We know that a3+b3+c33abc=(a+b+c)(a2+b2+c2abbcca) a^3 + b^3 + c^3 - 3abc = (a + b + c)(a^2 + b^2 + c^2 - ab - bc - ca) .
4. Given Condition: a+b+c=2pq(p30+q30) a + b + c = 2pq(p^{30} + q^{30}) .
5. Evenness: Since a+b+c a + b + c is even, k=a3+b3+c3 k = a^3 + b^3 + c^3 must also be even.
6. Prime Check: The smallest even prime number is 2. For k k to be 2, we would need a3+b3+c3=2 a^3 + b^3 + c^3 = 2 . However, this is impossible because a,b,c a, b, c are natural numbers and the smallest sum of cubes of natural numbers is 13+13+13=3 1^3 + 1^3 + 1^3 = 3 .
7. Conclusion: Since k k is even and greater than 2, k k cannot be a prime number.

### Part (b): Prove that if abc a \cdot b \cdot c is maximum, then 1984 1984 divides k k .

1. Given: a+b+c=2pq(p30+q30) a + b + c = 2pq(p^{30} + q^{30}) .
2. Divisibility by 3: Notice that a+b+c a + b + c is divisible by 3 because if 3p,q 3 \nmid p, q , then 3p2q2p30q30 3 \mid p^2 - q^2 \mid p^{30} - q^{30} . Hence, a+b+c a + b + c is divisible by 3.
3. AM-GM Inequality: To maximize abc a \cdot b \cdot c , by the Arithmetic Mean-Geometric Mean Inequality (AM-GM), a=b=c a = b = c .
4. **Expression for a a **: Let a=b=c=2pq(p30+q30)3 a = b = c = \frac{2pq(p^{30} + q^{30})}{3} .
5. **Expression for k k **:
k=3a3=3(2pq(p30+q30)3)3=8p3q3(p30+q30)39 k = 3a^3 = 3 \left( \frac{2pq(p^{30} + q^{30})}{3} \right)^3 = \frac{8p^3q^3(p^{30} + q^{30})^3}{9}
6. Divisibility by 64: If at least one of p p or q q is even, k k is visibly divisible by 64 64 . If both are odd, (p30q30)3 (p^{30} - q^{30})^3 has an extra factor of 8 8 to complete the factor of 64 64 .
7. Divisibility by 31: If at least one of p p or q q is divisible by 31, so is k k . If not, (31,pq)=1 (31, pq) = 1 and by Fermat's Little Theorem, p30q301(mod31) p^{30} \equiv q^{30} \equiv 1 \pmod{31} , so p30q300(mod31) p^{30} - q^{30} \equiv 0 \pmod{31} . Thus, k k is divisible by 31.
8. Conclusion: Combining these, k k is divisible by 6431=1984 64 \cdot 31 = 1984 .

The final answer is k \boxed{ k } is divisible by 1984 1984 .

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