Maths Olympiad Prep

Library / /90 of 1394

, 2023

Combinatorics Difficulty 4.7 AIME Find the answer United States

Problem:

Each cell of a 3×33 \times 3 grid is labeled with a digit in the set {1,2,3,4,5}\{1,2,3,4,5\}. Then, the maximum entry in each row and each column is recorded. Compute the number of labelings for which every digit from 11 to 55 is recorded at least once.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Solution:

We perform casework by placing the entries from largest to smallest.

- The grid must have exactly one 55 since an entry equal to 55 will be the maximum in its row and in its column. We can place this in 99 ways.
- An entry equal to 44 must be in the same row or column as the 55; otherwise, it will be recorded twice, so we only have two records left but 1,21,2, and 33 are all unrecorded. Using similar logic, there is at most one 44 in the grid. So there are 44 ways to place the 44.
- We further split into cases for the 33 entries. Without loss of generality, say the 44 and the 55 are in the same row.

- If there is a 33 in the same row as the 44 and the 55, then it remains to label a 2×32 \times 3 grid with 11s and 22s such that there is exactly one row with all 11s, of which there are 2(231)=142\left(2^{3}-1\right)=14 ways to do so.

- Suppose there is no 33 in the same row as the 44 and the 55. Then there are two remaining empty rows to place a 33.

There are two possible places we could have a record of 22, the remaining unoccupied row or the remaining unoccupied column. There are 22 ways to pick one of these; without loss of generality, we pick the row. Then the column must be filled with all 11s, and the remaining slots in the row with record 22 can be filled in one of 33 ways (1212, 2121, or 2222). The final empty cell can be filled with a 1,21,2, or 33, for a total of 33 ways. Our total here is 2235=602 \cdot 2 \cdot 3 \cdot 5=60 ways.

Hence, our final answer is 94(14+60)=3674=26649 \cdot 4 \cdot (14+60)=36 \cdot 74=2664.

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.