Maths Olympiad Prep

Library / /193 of 1394

, 2018

Combinatorics Difficulty 4.9 AIME Find the answer United States

Problem:

A 4×44 \times 4 window is made out of 16 square windowpanes. How many ways are there to stain each of the windowpanes, red, pink, or magenta, such that each windowpane is the same color as exactly two of its neighbors? Two different windowpanes are neighbors if they share a side.

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

Solution

Solution:

For the purpose of explaining this solution, let's label the squares as
11121314
21222324
31323334
41424344

Note that since the corner squares 11,14,41,4411,14,41,44 each only have two neighbors, each corner square is the same color as both of its neighbors (for example, 11,1211,12, and 2121 are the same color, 31,4131,41, and 4242 are the same color, etc.). This corner square constraint heavily limits the possible colorings. We will now use casework.

Case 1: Suppose two corner squares on the same side (without loss of generality, let them be 1111 and 1414) have the same color (without loss of generality, red). Then 21,11,12,13,14,2421,11,12,13,14,24 are all red, and 1212 has two red neighbors (1111 and 1313) so its third neighbor (2222) is a color different from red (without loss of generality, magenta). But 2222 has two red neighbors (1212 and 2121), so its other two neighbors (2323 and 3232) must be magenta. Applying the same logic symmetrically, we find that all four interior squares (22,23,32,33)(22,23,32,33) have the same color. Furthermore, 2121 has one magenta neighbor 2222, so 3131 must be red. Symmetrically, 3434 is red, and by the corner square constraint we have that all the exterior squares are the same color. Thus in general, this case is equivalent to a window taking the following form (with distinct colors AA and BB):

AAAAABBAABBAAAAA \begin{array}{llll} A & A & A & A \\ A & B & B & A \\ A & B & B & A \\ A & A & A & A \end{array}

The number of choices of AA and BB is 32=63 \cdot 2=6.

Case 2: No two corner squares on the same side have the same color.
Then from the corner square constraint 1212 has neighbor 1111 of the same color and neighbor 1313 of a different color, so its neighbor 2222 must be the same color as 1212. Therefore, this case is equivalent to coloring each quadrant entirely in one color such that two quadrants sharing a side have different colors. (A quadrant refers to the four squares on one vertical half and one horizontal half, e.g. 13,14,23,2413,14,23,24). If only two colors are used, the window will take the form (with distinct colors AA and BB):

AABBAABBBBAABBAA \begin{array}{llll} A & A & B & B \\ A & A & B & B \\ B & B & A & A \\ B & B & A & A \end{array}

Again there are 32=63 \cdot 2=6 ways to choose AA and BB.

If all three colors are used, the window will take the form (with distinct colors A,BA, B and CC):

AABBAABBCCAACCAA \begin{array}{llll} A & A & B & B \\ A & A & B & B \\ C & C & A & A \\ C & C & A & A \end{array}

or

AAAABBBB
AAAABBBB
BBBBCCCC
BBBBCCCC

There are 321=63 \cdot 2 \cdot 1=6 ways to select colors for each of these forms.

Therefore, there are 66 colorings in Case 1 and 6+6+66+6+6 in Case 2, for a total of 2424 colorings.

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.