Maths Olympiad Prep

Library / /125 of 136

Combinatorics Difficulty 8.5 Shortlist Prove it Hong Kong

In a conference, there are 20022002 representatives from 100100 countries. The number of representatives from each country is at least 11 and at most 4545. They are seated in rows with each row consisting of 4545 seats. It is required that the representatives from the same country must be seated in the same row. What is the smallest number of rows needed to ensure that all representatives can be seated? Justify your answer.

Solution

At least 8686 rows are needed.
Suppose there are 8686 (type A) countries with 2323 representatives each, 1010 countries with 22 representatives each, and 44 countries with 11 representative each. Then there are 86+10+4=10086 + 10 + 4 = 100 countries and 86×23+10×2+4×1=200286 \times 23 + 10 \times 2 + 4 \times 1 = 2002 representatives. No two type A countries may sit in the same row since 23×2>4523 \times 2 > 45. Thus, at least 8686 rows are needed.

We now show that it is always sufficient to use 8686 rows. We arrange the countries in decreasing order of the number of representatives. We first put all representatives from country 11 in the first row. Next, if all representatives from country 22 can be seated in the same row as country 11, we put them in that row, or otherwise they are put in the next row. Similarly, if all representatives from country k+1k+1 can be seated in the same row as country kk, we put them in that row, or otherwise they are put in the next row. We do the same thing until all representatives are seated or all 8686 rows are used up.

It suffices to consider the case when all 8686 rows are used up but some representatives still do not have a seat. We claim that each row consists of at least 2323 representatives. If not, there are at least 2323 empty seats in some row jj, which means the next country to be put has at least 2424 representatives. But then there should be at least 2424 representatives in row jj as well according to the order of the countries. This is a contradiction. It follows that the number of representatives remaining is at most
200223×86=24. 2002 - 23 \times 86 = 24.
Among these representatives, suppose cc of them come from the same country, where cc is maximized. First of all, we have c22c \le 22 since otherwise at least 9999 countries have at least 2323 representatives (except possibly the last country), which yields the contradiction that the total number of representatives is at least
23×99=2277>2002. 23 \times 99 = 2277 > 2002.
Now, we partition the remaining representatives into at most two groups by putting those cc representatives in one group. We claim that all groups have at most 2222 representatives. If not, since c22c \le 22, it must be the case that c=1c = 1 and there are 2323 more representatives. By the choice of cc, all these 2424 representatives come from different countries. But this is impossible since there are at most 10086=14100 - 86 = 14 countries left.

Therefore, it remains to show that there are at least 22 rows with 2222 empty seats. Indeed, if this does not hold, then the total number of representatives is at least
24×85+23=2063>2002. 24 \times 85 + 23 = 2063 > 2002.
This is a contradiction, and so we are done.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.