There are 2024 cards of the same size, face-down on a table, on which the integers , , , , are written. We say that a card is a *winner* if it has a number divisible by or by . What is the minimum number of cards we need to turn face up to make sure that we obtain at least one winner?
Solution
There are multiples of not larger than : , , , .
There are multiples of not larger than : , , , .
There is only one common multiple of and not larger than , namely .
There are numbers not larger than , that are multiples of or multiples of . This leaves non-winners.
We are sure that we have obtained a winner as soon as we pick cards.
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.