Problem:
Compute the sum of all 2-digit prime numbers such that there exists a prime number for which is a perfect square.
Proposed by: Sheldon Kieren Tan
Problem:
Compute the sum of all 2-digit prime numbers such that there exists a prime number for which is a perfect square.
Proposed by: Sheldon Kieren Tan
Solution:
All squares must end with , or , meaning that must end with and . Moreover, since all odd squares are , we know that must be . This rules all primes except for . Since , , , , and all work. To finish, we claim that does not work. If were a square, then since all odd squares are we find that , implying that is even. But is not a square, contradiction.
The final answer is .