Maths Olympiad Prep

Library / /12 of 42

Combinatorics Difficulty 5.5 AIME, harder Prove it Romania

There are 2024 cards of the same size, face-down on a table, on which the integers 11, 22, 33, \dots, 20242024 are written. We say that a card is a *winner* if it has a number divisible by 1313 or by 100100. 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 155155 multiples of 1313 not larger than 20242024: 13113 \cdot 1, 13213 \cdot 2, \dots, 1315513 \cdot 155.

There are 2020 multiples of 100100 not larger than 20242024: 1001100 \cdot 1, 1002100 \cdot 2, \dots, 10020100 \cdot 20.

There is only one common multiple of 1313 and 100100 not larger than 20242024, namely 13001300.

There are 155+201=174155 + 20 - 1 = 174 numbers not larger than 20242024, that are multiples of 1313 or multiples of 100100. This leaves 2024174=18502024 - 174 = 1850 non-winners.

We are sure that we have obtained a winner as soon as we pick 1850+1=18511850 + 1 = 1851 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.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.