2025 AMC 10B Problem 16

Below is the professionally curated solution for Problem 16 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:graph theorycomplementary countingcasework

Difficulty rating: 1800

16.

A circle has been divided into 66 sectors of 66 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 six unequal sectors form a fixed cycle of 66 distinguishable positions, so we want proper 33-colorings of a 66-cycle that use each color exactly twice. A 66-cycle has 26+2=662^6 + 2 = 66 proper 33-colorings altogether. Of these, 66 use only two colors (type (3,3,0)(3,3,0)) and 3636 use one color three times (type (3,2,1)(3,2,1)). That leaves 66636=24.66 - 6 - 36 = 24. Therefore, the answer is D.

Problem 16 in Other Years