Maths Olympiad Prep

Track / Stage 7 / 284 of 300 #2164 of 2444

Problem 2164

National Olympiad second round; IMO P1/P4
Number theory Difficulty 7.9 Prove it Team selection test for 50. IMO · Bulgaria

Let MM 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 MM are integers.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Let a1,,a2008Ma_1, \dots, a_{2008} \in M and A=a1a2008=pqA = a_1 \dots a_{2008} = \frac{p}{q}, (p,q)=1(p, q) = 1. Assume that MM contains infinitely many numbers αi=piqi\alpha_i = \frac{p_i}{q_i} such that (pi,qi)=1(p_i, q_i) = 1, qi>1q_i > 1 and αia1,,a2008\alpha_i \ne a_1, \dots, a_{2008}. Since αip\alpha_i p is an integer, then qiq_i divides pp and hence infinitely many of the numbers qiq_i are equal. Then the product of 2009 of the respective αj\alpha_j is not an integer, a contradiction. In particular, MM contains infinitely many integers.

Assume now that abM\frac{a}{b} \in M, (a,b)=1(a, b) = 1 and b>1b > 1. If pp is a prime divisor of bb, then the given condition easily implies that pp divides infinitely many integers in MM. Then the product of any 2009 of them is divisible by p2009p^{2009}, a contradiction.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.