Skip to main content

2025 AMC 12B Problem 17

Problem 17 of 25IntermediateCounting & Probability

Each of the 99 squares in a 3×33 \times 3 grid is to be colored red, blue, or yellow in such a way that each red square shares an edge with at least one blue square, each blue square shares an edge with at least one yellow square, and each yellow square shares an edge with at least one red square. Colorings that can be obtained from one another by rotations and/or reflections are to be considered the same. How many different colorings are possible?

Answer choices

Show solution

Solution

First count colorings of the grid with its positions labeled. Checking the 2727 possible rows in succession and rejecting a row as soon as a square whose neighbors are now known lacks its required next color gives the following complete count by the numbers of red, blue, and yellow squares: (#R,#B,#Y)valid colorings(2,4,3)16(3,2,4)16(3,3,3)36(4,3,2)16 \begin{array}{c|c} (\#R,\#B,\#Y)&\text{valid colorings}\\ \hline (2,4,3)&16\\ (3,2,4)&16\\ (3,3,3)&36\\ (4,3,2)&16 \end{array} Thus the identity symmetry fixes 16+16+36+16=8416+16+36+16=84 colorings. For the other symmetries, the fixed-coloring counts are 00 for each nontrivial rotation, 66 for each reflection across a horizontal or vertical axis, and 00 for each diagonal reflection. (For an axis reflection, a direct check of the three palindromic rows gives the 66 possibilities.) Therefore Burnside’s lemma gives 84+268=12. \frac{84+2\cdot6}{8}=12. Thus, the correct answer is C.

More practice

Concepts: Burnside’s Lemma · casework

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.