2025 AMC 10B Problem 21

Below is the professionally curated solution for Problem 21 of the 2025 AMC 10B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2025 AMC 10B solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:Burnside’s Lemmacasework

Difficulty rating: 2100

21.

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?

33

99

1212

1818

2727

Solution:

The rules chain in a cycle: every red touches a blue, every blue touches a yellow, every yellow touches a red. Enumerate the labeled 3×33 \times 3 grid, and exactly 8484 colorings meet all three edge conditions. Group these into orbits under the 88 symmetries of the square, four rotations and four reflections, and 1212 distinct colorings remain. Thus, C is the correct answer.

Problem 21 in Other Years