Maths Olympiad Prep

Library / /44 of 57

, 2009

Number theory Difficulty 6.3 National Olympiad Prove it JBMO

Problem:
Determine all prime numbers p1,p2,,p12,p13p_{1}, p_{2}, \ldots, p_{12}, p_{13}, p1p2p12p13p_{1} \leq p_{2} \leq \ldots \leq p_{12} \leq p_{13}, such that
p12+p22++p122=p132 p_{1}^{2}+p_{2}^{2}+\ldots+p_{12}^{2}=p_{13}^{2}
and one of them is equal to 2p1+p92 p_{1}+p_{9}.

Solution

Solution:
Obviously, p132p_{13} \neq 2, because sum of squares of 12 prime numbers is greater or equal to 12×22=4812 \times 2^{2}=48. Thus, p13p_{13} is odd number and p137p_{13} \geq 7.
We have that n21(mod8)n^{2} \equiv 1 \pmod{8}, when nn is odd. Let kk be the number of prime numbers equal to 22. Looking at equation modulo 88 we get:
4k+12k1(mod8) 4k + 12 - k \equiv 1 \pmod{8}
So, k7(mod8)k \equiv 7 \pmod{8} and because k12k \leq 12 we get k=7k=7. Therefore, p1=p2==p7=2p_{1}=p_{2}=\ldots=p_{7}=2. Furthermore, we are looking for solutions of equations:
28+p82+p92+p102+p112+p122=p132 28 + p_{8}^{2} + p_{9}^{2} + p_{10}^{2} + p_{11}^{2} + p_{12}^{2} = p_{13}^{2}
where p8,p9,,p13p_{8}, p_{9}, \ldots, p_{13} are odd prime numbers and one of them is equal to p9+4p_{9}+4.
Now, we know that when nn is not divisible by 33, n21(mod3)n^{2} \equiv 1 \pmod{3}. Let ss be number of prime numbers equal to 33. Looking at equation modulo 33 we get:
28+5s1(mod3) 28 + 5 - s \equiv 1 \pmod{3}
Thus, s2(mod3)s \equiv 2 \pmod{3} and because s5s \leq 5, ss is either 22 or 55. We will consider both cases.

i. When s=2s=2, we get p8=p9=3p_{8}=p_{9}=3. Thus, we are looking for prime numbers p10p11p12p13p_{10} \leq p_{11} \leq p_{12} \leq p_{13} greater than 33 and at least one of them is 77 (certainly p137p_{13} \neq 7), that satisfy
46+p102+p112+p122=p132 46 + p_{10}^{2} + p_{11}^{2} + p_{12}^{2} = p_{13}^{2}
We know that n21(mod5)n^{2} \equiv 1 \pmod{5} or n24(mod5)n^{2} \equiv 4 \pmod{5} when nn is not divisible by 55. It is not possible that p10=p11=5p_{10}=p_{11}=5, because in that case p12p_{12} must be equal to 77 and the left-hand side would be divisible by 55, which contradicts the fact that p137p_{13} \geq 7. So, we proved that p10=5p_{10}=5 or p10=7p_{10}=7.

If p10=5p_{10}=5 then p11=7p_{11}=7 because p11p_{11} is the least of remaining prime numbers. Thus, we are looking for solutions of equation
120=p132p122 120 = p_{13}^{2} - p_{12}^{2}
in prime numbers. Now, from
2335=(p13p12)(p13+p12) 2^{3} \cdot 3 \cdot 5 = (p_{13} - p_{12})(p_{13} + p_{12})
that desired solutions are p12=7,p13=13p_{12}=7, p_{13}=13; p12=13,p13=17p_{12}=13, p_{13}=17; p12=29,p13=31p_{12}=29, p_{13}=31.

If p10=7p_{10}=7 we are solving equation:
95+p112+p122=p132 95 + p_{11}^{2} + p_{12}^{2} = p_{13}^{2}
in prime numbers greater than 55. But left side can give residues 00 or 33 modulo 55, while right side can give only 11 or 44 modulo 55. So, in this case we do not have solution.

ii. When s=5s=5 we get equation:
28+45=73=p132 28 + 45 = 73 = p_{13}^{2}
but 7373 is not square or integer and we do not have solution in this case.

Finally, only solutions are:
{(2,2,2,2,2,2,2,3,3,5,7,7,13),(2,2,2,2,2,2,2,3,3,5,7,13,17),(2,2,2,2,2,2,2,3,3,5,7,29,31)}\{(2,2,2,2,2,2,2,3,3,5,7,7,13), (2,2,2,2,2,2,2,3,3,5,7,13,17), (2,2,2,2,2,2,2,3,3,5,7,29,31)\}.

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.