Maths Olympiad Prep

Library / /3 of 20

Number theory Difficulty 4.5 AIME Prove it United States

Problem:

Find all prime numbers pp such that p2+8p^{2}+8 is prime number, as well.

Solution

Solution:

For p=3p=3 we have p2+8=17p^{2}+8=17, which is prime.

If p3p \neq 3 then pp is not divisible by 33. The remainder of pp when divided by 33 is either 11 or 22. This means that p=3k+1p=3k+1 for some integer kk, or p=3l+2p=3l+2 for some integer ll.

In the first case we get p2=(3k+1)2=9k2+6k+1p^{2}=(3k+1)^{2}=9k^{2}+6k+1 and in the second, p2=(3l+2)2=9l2+12l+4p^{2}=(3l+2)^{2}=9l^{2}+12l+4.

In both cases p2p^{2} gives a remainder 11 upon division by 33. Hence p2+8p^{2}+8 is divisible by 33 for all prime numbers different than 33.

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.