AMC 10 Step by Step

2022 AMC 10A Problem 9

P1-10~3 minPrint

A rectangle is partitioned into 55 regions as shown. Each region is to be painted a solid color - red, orange, yellow, blue, or green - so that regions that touch are painted different colors, and colors can be used more than once. How many different colorings are possible?

figure

Log in to save your progress.
Show solution without answering

Key insight

The wide bottom-middle region touches all four others. Paint it first, then go around the other four in order: 4 choices for the first, then 3 for each.

Solution

1. Name the regions. Bottom row, left to right: a small piece LL, a wide middle piece MM, and a right piece RR. Top row: a left piece UU and a right piece VV.
2. Which regions touch? Reading the picture:
- MM touches all four others: LL, RR, UU and VV.
- LL touches UU; UU touches VV; VV touches RR.
- LL does not touch RR or VV, and UU does not touch RR.
3. Paint the busiest region first. MM touches everything, so it limits the most. It gets any of the 55 colors.
4. Go around the other four in the order L,U,V,RL, U, V, R. Each one touches MM and the region painted just before it, and those two already have different colors:
- LL: any color except MM's. 44 choices.
- UU: not MM's color and not LL's. 33 choices.
- VV: not MM's and not UU's. 33 choices.
- RR: not MM's and not VV's. 33 choices.
5. Multiply. 5×4×3×3×3=5405 \times 4 \times 3 \times 3 \times 3 = 540.

The answer is (D) 540\boxed{\textbf{(D)}\ 540}.

Why this works

When counting colorings, choose an order in which each new region has a known number of already-painted neighbors, all with different colors. Starting with the region that touches everything does this: every later region sees exactly two different colors (or one, for the first), so each count is a fixed number and you simply multiply.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Name the regions: the bottom row has a small left piece LL, a wide middle piece MM, and a right piece RR; the top row has a left piece UU and a right piece VV. Reading the figure, MM touches all four others; LL touches UU; UU touches VV; VV touches RR. The pairs L,RL, R and L,VL, V and U,RU, R do not touch.

Color MM first: 55 choices. Then color the others in the order L,U,V,RL, U, V, R, so that each new region touches exactly two already-colored regions, MM and the previous one, which always have different colors:

  • LL: any color but MM's, 44 choices.
  • UU: not MM's or LL's color, 33 choices.
  • VV: not MM's or UU's color, 33 choices.
  • RR: not MM's or VV's color, 33 choices.

Total: 5⋅4⋅3⋅3⋅3=5405 \cdot 4 \cdot 3 \cdot 3 \cdot 3 = 540.

The answer is (D) 540\boxed{\textbf{(D)}\ 540}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.