Skip to main content
OlympiadHQ

Browse · MathNet

Print

Team selection test for 50. IMO

Bulgaria number theory

Problem

Let be an infinite set of rational numbers such that the product of any 2009 of them (pairwise different) is an integer which is not divisible by 2009th powers of primes. Prove that all the numbers in are integers.
Solution
Let and , . Assume that contains infinitely many numbers such that , and . Since is an integer, then divides and hence infinitely many of the numbers are equal. Then the product of 2009 of the respective is not an integer, a contradiction. In particular, contains infinitely many integers.

Assume now that , and . If is a prime divisor of , then the given condition easily implies that divides infinitely many integers in . Then the product of any 2009 of them is divisible by , a contradiction.

Techniques

Prime numbersGreatest common divisors (gcd)Pigeonhole principle