In a conference, there are representatives from countries. The number of representatives from each country is at least and at most . They are seated in rows with each row consisting of 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 rows are needed.
Suppose there are (type A) countries with representatives each, countries with representatives each, and countries with representative each. Then there are countries and representatives. No two type A countries may sit in the same row since . Thus, at least rows are needed.
We now show that it is always sufficient to use rows. We arrange the countries in decreasing order of the number of representatives. We first put all representatives from country in the first row. Next, if all representatives from country can be seated in the same row as country , we put them in that row, or otherwise they are put in the next row. Similarly, if all representatives from country can be seated in the same row as country , 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 rows are used up.
It suffices to consider the case when all rows are used up but some representatives still do not have a seat. We claim that each row consists of at least representatives. If not, there are at least empty seats in some row , which means the next country to be put has at least representatives. But then there should be at least representatives in row as well according to the order of the countries. This is a contradiction. It follows that the number of representatives remaining is at most
Among these representatives, suppose of them come from the same country, where is maximized. First of all, we have since otherwise at least countries have at least representatives (except possibly the last country), which yields the contradiction that the total number of representatives is at least
Now, we partition the remaining representatives into at most two groups by putting those representatives in one group. We claim that all groups have at most representatives. If not, since , it must be the case that and there are more representatives. By the choice of , all these representatives come from different countries. But this is impossible since there are at most countries left.
Therefore, it remains to show that there are at least rows with empty seats. Indeed, if this does not hold, then the total number of representatives is at least
This is a contradiction, and so we are done.