Browse · MathNet
PrintBxMO Team Selection Test, March 2020
Netherlands 2020 number theory
Problem
A set consisting of (distinct) positive integers has the following property: the product of any elements of is a divisor of the product of the other elements. What is the maximum number of prime numbers that could contain?
Solution
We start with the construction. Choose distinct primes , and let . Let For each , there are numbers in that are divisible by (namely, and all multiples of ). Of these, at most one has two factors ; the rest has only one factor . If we now take numbers from , then their product has at most factors . The other numbers contain at least numbers which are divisible by , hence their product has at least factors . Because this holds for any , and the numbers in do not have any other prime factors, this implies that has the desired property.
We now prove that cannot contain more than primes. Consider a prime divisor of a number in . Suppose that at most numbers are divisible by . Then we take the elements of having the most factors ; these always have more factors in total than the other elements, which contradicts the condition in the problem statement. Hence, there are at least numbers in which are divisible by . If there are exactly , then we also get that the number of factors in all of these numbers must be equal, otherwise we get a contradiction again by taking the elements having the most factors .
We see that contains at least non-primes, because a prime in divides at least other elements of . Suppose that contains exactly non-primes. Then the prime factor in each of these non-primes occurs exactly once (namely, equally often as in the prime number ). Moreover, the numbers in cannot be divisible by a prime that is not contained in , because then there would be at least multiples of inside , and these would be non-primes, which is a contradiction. We get that each of the non-primes in must be the product of the primes in . In particular, these numbers are not distinct. This is a contradiction, hence must contain at least non-primes, and hence at most primes.
We now prove that cannot contain more than primes. Consider a prime divisor of a number in . Suppose that at most numbers are divisible by . Then we take the elements of having the most factors ; these always have more factors in total than the other elements, which contradicts the condition in the problem statement. Hence, there are at least numbers in which are divisible by . If there are exactly , then we also get that the number of factors in all of these numbers must be equal, otherwise we get a contradiction again by taking the elements having the most factors .
We see that contains at least non-primes, because a prime in divides at least other elements of . Suppose that contains exactly non-primes. Then the prime factor in each of these non-primes occurs exactly once (namely, equally often as in the prime number ). Moreover, the numbers in cannot be divisible by a prime that is not contained in , because then there would be at least multiples of inside , and these would be non-primes, which is a contradiction. We get that each of the non-primes in must be the product of the primes in . In particular, these numbers are not distinct. This is a contradiction, hence must contain at least non-primes, and hence at most primes.
Final answer
1819
Techniques
Prime numbersFactorization techniquesColoring schemes, extremal arguments