2025 AMC 12B Problem 13

Below is the professionally curated solution for Problem 13 of the 2025 AMC 12B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2025 AMC 12B 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:graph theorymultiplication principle

Difficulty rating: 1660

13.

A circle has been divided into 66 sectors of different sizes. Then 22 of the sectors are painted red, 22 painted green, and 22 painted blue so that no two neighboring sectors are painted the same color. One such coloring is shown below.

How many different colorings are possible?

1212

1616

1818

2424

2828

Solution:

The two sectors of each color must be a non-adjacent pair, so a coloring is a way to split the 66 cyclic sectors into three non-adjacent pairs together with an assignment of the three colors. The non-adjacent pairs are the edges of the complement of the 66-cycle, the triangular prism, which has 44 perfect matchings. Assigning the three colors in 3!3! ways gives 4×6=244 \times 6 = 24 colorings.

Thus, the correct answer is D.

Problem 13 in Other Years