Positive integers from to inclusive are written on the blackboard. Andrew wants to cross out some numbers in such a way, that the product of the remaining numbers is not divisible by . What is the smallest number of numbers that he can cross?
Solution
Since , Andrew has to cross out from the product all numbers which are divisible by , except for two numbers that are not divisible by (for example, we can leave and ). The resulting product satisfies the condition because it is not divisible by . Meanwhile, Andrew crossed out numbers, because among the factors exactly are divisible by .
Let us assume that it is possible to cross out no more than numbers. Thus, among numbers that are divisible by , Andrew left at least three, then the product is divisible by . In order for the product not to be divisible by , all factors must be odd. However, since numbers are left and only initial numbers were odd, at least one of the factors is even. Contradiction completes the proof.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.