Maths Olympiad Prep

Library / /55 of 397

Combinatorics Difficulty 5.0 AIME, harder Prove it Taiwan

On a 2n×2n2n \times 2n chessboard, every square has a chair. Now there are 2n22n^2 couples who need to be seated, with each person occupying one seat. Define the distance between a couple as the sum of the number of rows and the number of columns by which their seats differ (for example: if a couple sit at (3,3) and (2,5) respectively, then their distance is 32+35=3|3-2| + |3-5| = 3). Define the total distance of all couples as the sum of the distances of these 2n22n^2 couples. Find the maximum value of the total distance.

Solution

The maximum value is 4n34n^3.

1. First consider the maximum value of the sum of horizontal distances: project everyone onto the same column, and connect the two people of each couple with a line segment. Consider two possibilities:
- There exist two couples whose connecting segments do not overlap: then take one person from each of the two couples and swap their positions, and the sum of horizontal distances becomes larger.
- The connecting segments of any two couples overlap: without loss of generality, assume that in every couple the man is to the left of the woman. We find that all the men must lie within the left nn columns, otherwise:
* If there is a couple with both the man and the woman in the right nn columns, then the right nn columns have only 2n222n^2 - 2 seats remaining, but there are still another 2n212n^2 - 1 couples that need to be seated.
* Therefore there must be a couple both of whom are in the left nn columns. However, a couple both of whom are in the left nn columns cannot have their connecting segment overlap with that of a couple both of whom are in the right nn columns, a contradiction!

In other words, the man of every couple must belong to the left nn columns, and the woman of every couple must belong to the right nn columns. It is easy to compute that the sum of horizontal distances in this case must be 2n32n^3.

2. Similarly, the maximum value of the sum of vertical distances is also 2n32n^3, so the total distance is at most 4n34n^3.

3. Finally, we show that there is a way to achieve 4n34n^3. Consider dividing the couples into two groups A,BA, B, each with n2n^2 couples, and dividing the seats into four quadrants (each quadrant being an n×nn \times n grid). Let the first quadrant be seated entirely with AA men, the second quadrant with BB women, the third quadrant with AA women, and the fourth quadrant with BB men. Then one can verify that this construction achieves the maximum value estimated above, which 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.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from zh; metadata (topic, difficulty) added by this project.