Browse · MathNet
PrintSelection tests for the Gulf Mathematical Olympiad 2013
Saudi Arabia 2013 counting and probability
Problem
Tarik wants to choose some distinct numbers from the set in such a way that each of the chosen numbers cannot be written as the product of two other distinct chosen numbers. What is the maximum number of numbers Tarik can choose?
Solution
First, we see that it is possible for Tarik to choose the 101 numbers , since the product .
Assume that Tarik has chosen numbers and let be the smallest among these numbers. If , then clearly, .
If , from each of the 9 sets , Tarik can choose at most one number. Because , these sets are pairwise disjoint. Because , there are at least 9 numbers between 9 and 102 that Tarik could not choose. Therefore .
If , from each of the sets , Tarik can choose at most one element. Because , these sets are pairwise disjoint. Because , there are at least numbers from these sets that Tarik could not choose. But Tarik didn't choose the numbers . Therefore, Tarik didn't choose at least numbers. Hence .
Therefore, the maximum number of numbers Tarik can choose is .
Assume that Tarik has chosen numbers and let be the smallest among these numbers. If , then clearly, .
If , from each of the 9 sets , Tarik can choose at most one number. Because , these sets are pairwise disjoint. Because , there are at least 9 numbers between 9 and 102 that Tarik could not choose. Therefore .
If , from each of the sets , Tarik can choose at most one element. Because , these sets are pairwise disjoint. Because , there are at least numbers from these sets that Tarik could not choose. But Tarik didn't choose the numbers . Therefore, Tarik didn't choose at least numbers. Hence .
Therefore, the maximum number of numbers Tarik can choose is .
Final answer
101
Techniques
Coloring schemes, extremal argumentsPigeonhole principle