Maths Olympiad Prep

Library / /68 of 220

Number theory Difficulty 5.5 AIME, harder Prove it Ukraine

It is given that there exists such prime pp, for which 1017p1017+1010^{17} \le p \le 10^{17} + 10. Find pp.

Solution

We should find the last digit of this number. It cannot be even or equal to 55.

Number 1017+110^{17} + 1 is divisible by 1111.

Consider number 1017+910^{17} + 9 modulo 77. Then, 103(mod7)1022(mod7)1031(mod7)10151(mod7)10172(mod7)1017+90(mod7)10 \equiv 3 \pmod{7} \Rightarrow 10^2 \equiv 2 \pmod{7} \Rightarrow 10^3 \equiv -1 \pmod{7} \Rightarrow 10^{15} \equiv -1 \pmod{7} \Rightarrow 10^{17} \equiv -2 \pmod{7} \Rightarrow 10^{17} + 9 \equiv 0 \pmod{7}.

Consider number 1017+710^{17} + 7 modulo 1717. 1010(mod17)1022(mod17)108161(mod17)10161(mod17)101710(mod17)1017+70(mod17)10 \equiv 10 \pmod{17} \Rightarrow 10^2 \equiv -2 \pmod{17} \Rightarrow 10^8 \equiv 16 \equiv -1 \pmod{17} \Rightarrow 10^{16} \equiv 1 \pmod{17} \Rightarrow 10^{17} \equiv 10 \pmod{17} \Rightarrow 10^{17} + 7 \equiv 0 \pmod{17}.

Thus, the only candidate for a prime number left is 1017+310^{17} + 3, and since it is given that such a number exists, this must be it.

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.