Browse · MathNet
PrintSAUDI ARABIAN MATHEMATICAL COMPETITIONS
Saudi Arabia number theory
Problem
Let integer numbers are given. Let Hamza writes on the paper the greatest common divisor for each pair of numbers. It occurs that the difference between the biggest and smallest numbers written on the paper is less than . Prove that not all numbers on the paper are different.
Solution
Let be the given numbers and suppose on the contrary that the set of all numbers, which are written on the paper, are all different, Denote as the number of even values among the given numbers, and as the number of even values in . It is easy to see that for any , there exist such that ; and this number is even if and only if are both even. Hence, we have .
Then the number of odd values in is . Since then the number of even values and odd values in does not exceed , which implies that Note that so there does not exist positive integer such that , contradiction. Hence, the numbers written on the paper cannot be all different.
Then the number of odd values in is . Since then the number of even values and odd values in does not exceed , which implies that Note that so there does not exist positive integer such that , contradiction. Hence, the numbers written on the paper cannot be all different.
Techniques
Greatest common divisors (gcd)Pigeonhole principleColoring schemes, extremal arguments