Browse · MathNet
PrintHellenic Mathematical Olympiad
Greece number theory
Problem
Let , be positive integers such that the number is an integer. Assume that is odd. Prove that is a perfect square.
Solution
Let . The last one can be re-written as: We will prove that is odd. Indeed, if , then , and thus is even, a contradiction.
We consider (1) as a quadratic with respect to : The discriminant should be a perfect square. We have It follows that the product of the numbers , is a perfect square, but since is odd, these two numbers are coprime and so each one of them is a perfect square, so is a perfect square.
Let and we write , , with . Observe that since and is odd, is odd. The number is an integer. So and since , we have . Moreover, and since is odd, . From these two, we have that , so .
We consider (1) as a quadratic with respect to : The discriminant should be a perfect square. We have It follows that the product of the numbers , is a perfect square, but since is odd, these two numbers are coprime and so each one of them is a perfect square, so is a perfect square.
Let and we write , , with . Observe that since and is odd, is odd. The number is an integer. So and since , we have . Moreover, and since is odd, . From these two, we have that , so .
Techniques
Greatest common divisors (gcd)Quadratic functions