Problem:
Determine all prime numbers such that and are both prime numbers.
Solutions — 2
Solution 1
Solution:
If then the units digit of must be 1, 3, 7 or 9.
- If the units digit of is 1 or 9 then the units digit of is 1. Therefore the units digit of is 5. Since this means that is not prime.
- If the units digit of is 3 or 7 then the units digit of is 9. Therefore the units digit of is 5. Since this means that is not prime.
Therefore we must have . Hence must be 2, 3 or 5.
- If then is not prime.
- If then is not prime.
- If then are 19 and 31 which are both prime.
Therefore the only answer is .
Solution 2
Solution:
Consider the following product modulo 5.
By Fermat's Little Theorem, this product is 0 (mod 5). So if , and are all prime numbers then at least one of them must be equal to 5.
- If then and . This is one solution.
- If then . Neither 1 nor is prime, so this case leads to no solutions.
- If then is not an integer. No solutions in this case.
Therefore the only solution is .