Skip to main content
OlympiadHQ

Browse · MathNet

Print

Final Round

Netherlands number theory

Problem

Determine all pairs of integers such that is a perfect square and is a prime number.
Solution
We have for some nonnegative integer , and for some prime number . Since a prime number is never a perfect square, we see that . Since is a perfect square, it follows that and must both be positive, or both be negative. If is a solution, then so is . Therefore, we may for now assume that and are positive, and at the end, add for each solution the pair to the list of solutions. Combining and yields . By bringing to the other side, we find Since is positive, also must be positive. The prime number can be written as a product of two positive integers in only two ways: and . Since , we obtain and .

Adding these two equations, we get . We also know that , so . By bringing all terms to the right-hand side and adding 1 to both sides, we obtain We now have two perfect squares that add up to 1. This implies that one of the squares is 0 and the other is 1. So and , or and . As and are positive, we find two possible solutions: and , or and . In both cases is a perfect square and is a prime number. It follows that both are indeed solutions. Adding the solutions obtained by replacing by , we obtain a total of four solutions , namely
Final answer
(1, 2), (2, 1), (-1, -2), (-2, -1)

Techniques

Prime numbersFactorization techniquesTechniques: modulo, size analysis, order analysis, inequalities