Problem:
Find all prime numbers such that is prime number, as well.
Problem:
Find all prime numbers such that is prime number, as well.
Solution:
For we have , which is prime.
If then is not divisible by . The remainder of when divided by is either or . This means that for some integer , or for some integer .
In the first case we get and in the second, .
In both cases gives a remainder upon division by . Hence is divisible by for all prime numbers different than .