Maths Olympiad Prep

Track / Stage 5 / 116 of 400 #1196 of 2444

Problem 1196

AIME late
Combinatorics Difficulty 5.2 Find the answer HMMT February

In how many ways can we enter numbers from the set {1,2,3,4}\{1,2,3,4\} into a 4×44 \times 4 array so that all of the following conditions hold? (a) Each row contains all four numbers. (b) Each column contains all four numbers. (c) Each "quadrant" contains all four numbers. (The quadrants are the four corner 2×22 \times 2 squares.)

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

Next problem →

Official solution

Call a filled 4×44 \times 4 array satisfying the given conditions cool. There are 4 ! possibilities for the first row; WLOG, let it be 1234. Since each quadrant has to contain all four numbers, we have exactly four possibilities for the second row, namely: (i) 3412 (ii) 3421 (iii) 4312 (iv) 4321 I claim that the number of cool arrays with (i) is equal to those with (iv), and that the number of cool arrays with (ii) is equal to those with (iii). Let's first consider (i) and (iv). Now, (i) is 1234 3412 while (iv) is 1234 In (iv), switch 3 and 4 (relabeling doesn't affect the coolness of the array); then, it becomes * 1243\text{* 1243} 3421 Now, interchange the last two columns, which also does not affect the coolness. This gives us (i). Hence, the cool arrays with (i) and the cool arrays with (iv) have a 1:1 correspondence. Using the exact same argument, we can show that the number of cool arrays with (ii) equals those with (iii). So we only need consider cases (i) and (ii). It is easy to verify that there are four cool arrays with (i), determined precisely by, say, the first two entries of the third row; and two with (ii), determined precisely by, say the first entry of the third row. Hence, the answer is 4!×(4+2)×2=2884!\times(4+2) \times 2=288.

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.