Browse · MathNet
PrintSlovenija 2008
Slovenia 2008 number theory
Problem
Let and be positive integers of different parity. Show that can never be a perfect square.
Solution
Let us assume there exist numbers and , one even and one odd, such that is a perfect square. Let be the greatest common divisor of and , and write , . Then and are coprime and can be written as Let . Since is a perfect square, so is .
Let be a positive integer that divides both and . Since and have different parity, the numbers and are odd and must be odd, too. On the other hand we have so and , which implies . We have shown that and are coprime.
Let be a positive integer such that and . Again, must be odd and So, and , which implies . We conclude that and are coprime.
Similarly, one can show that and are coprime. Now, assume and . Then and , so , and .
We have shown that the two factors and are coprime to any other factor of , and since is a perfect square, we see that and must be perfect squares as well. Denote them by and , respectively. Then The right-hand side is divisible by but not by because and have different parity. On the other hand, and have the same parity and since their product is divisible by , it must also be divisible by . This contradiction shows that cannot be a perfect square.
Let be a positive integer that divides both and . Since and have different parity, the numbers and are odd and must be odd, too. On the other hand we have so and , which implies . We have shown that and are coprime.
Let be a positive integer such that and . Again, must be odd and So, and , which implies . We conclude that and are coprime.
Similarly, one can show that and are coprime. Now, assume and . Then and , so , and .
We have shown that the two factors and are coprime to any other factor of , and since is a perfect square, we see that and must be perfect squares as well. Denote them by and , respectively. Then The right-hand side is divisible by but not by because and have different parity. On the other hand, and have the same parity and since their product is divisible by , it must also be divisible by . This contradiction shows that cannot be a perfect square.
Techniques
Greatest common divisors (gcd)Techniques: modulo, size analysis, order analysis, inequalities