Browse · MathNet
Print50th Mathematical Olympiad in Ukraine, Fourth Round (March 23, 2010)
Ukraine 2010 number theory
Problem
Natural numbers are chosen in such a way, that the number is natural. Prove that is composite.
Solution
Let us suppose that we can find such numbers , that is prime. Then is complete square, and are distinct. By Cauchy-Schwartz inequality . Besides this, we have . is an odd number, because it is greater than , thus is natural. From the equality it follows, that either or is divisible by , but absolute value of each of these two numbers does not exceed , which is less than . This contradiction finishes the proof.
---
Alternative solution.
From the condition of the problem, it follows that is a natural number, which immediately gives us that is also a natural number. Therefore, . This implies that can be factored in such a way that is divisible by , and is divisible by .
. Both factors and are natural and greater than one, thus, is composite.
---
Alternative solution.
From the condition of the problem, it follows that is a natural number, which immediately gives us that is also a natural number. Therefore, . This implies that can be factored in such a way that is divisible by , and is divisible by .
. Both factors and are natural and greater than one, thus, is composite.
Techniques
Factorization techniquesCauchy-Schwarz