2021 AMC 10A Problems/Problem 25

Revision as of 23:49, 11 February 2021 by Happykeeper (talk | contribs) (Solution)

Problem 25

How many ways are there to place $3$ indistinguishable red chips, $3$ indistinguishable blue chips, and $3$ indistinguishable green chips in the squares of a $3 \times 3$ grid so that no two chips of the same color are directly adjacent to each other, either vertically or horizontally.

$\textbf{(A)} ~12\qquad\textbf{(B)} ~18\qquad\textbf{(C)} ~24\qquad\textbf{(D)} ~30\qquad\textbf{(E)} ~36$

Solution

Call the different colors A,B,C. There are $3!=6$ ways to rearrange these colors to these three letters, so we must remember to multiply by 6. We can assume that A is in the center. In this configuration, the other 2 A's must either lie on the same diagonal or lie in adjacent corner squares. There are two ways to place the A's in the former, while there are four ways to place the A's in the latter. In each case there is only one way to put the three B's and the three C's as shown in the diagrams. This means that there are 4+2=6 ways to arrange A,B, and C in the grid, and there are 6 ways to rearrange the colors. Therefore, there are $6\cdot6=36$ ways in total, which is $\boxed{\text{E}}$.

(someone who knows asy please help me insert diagrams, thanks in advance!)

-happykeeper

Video Solution by OmegaLearn (Symmetry, Casework, and Reflections/Rotations)

https://youtu.be/wKJ9ppI-8Ew

~ pi_is_3.14