2017 AMC 10B Problems/Problem 18

Revision as of 12:35, 17 February 2017 by Tdeng (talk | contribs) (Solution)

Problem

In the figure below, $3$ of the $6$ disks are to be painted blue, $2$ are to be painted red, and $1$ is to be painted green. Two paintings that can be obtained from one another by a rotation or a reflection of the entire figure are considered the same. How many different paintings are possible?

$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 12\qquad\textbf{(E)}\ 15$

Solution

Solution 1

First we figure out the number of ways to put the $3$ blue disks. Denote the spots to put the disks as $1-6$ from left to right, top to bottom. The cases to put the blue disks are $(1,2,3),(1,2,4),(1,2,5),(1,2,6),(2,3,5),(1,4,6)$. For each of those cases we can easily figure out the number of ways for each case, so the total amount is $2+2+3+3+1+1 = \boxed{\textbf{(D) } 12}$.

Solution 2

Denote the $6$ discs as in the first solution. Ignoring reflections or rotations, there are $\binom{6}{3} * \binom{3}{2} = 60$ colorings. Now we need to count the number of fixed points under possible transformations:

1. The identify transformation. Since this doesn't change anything, there are $60$ fixed points

2. Reflect about a line of symmetry. There are $3$ lines of reflections. Take the line of reflection going through the centers of circles $1$ and $5$. Then, the colors of circles $2$ and $3$ must be the same, and the colors of circles $4$ and $6$ must be the same. This gives us $4$ fixed points per line of reflection

3. Rotate by $120^\circ$ counter clockwise or clockwise with respect to the center of the diagram. Take the clockwise case for example. There will be a fixed point in this case if the colors of circles $1$, $4$, and $6$ will be the same. Similarly, the colors of circles $2$, $3$, and $5$ will be the same. This is impossible, so this case gives us $0$ fixed points per rotation.

By Burnside's lemma, the total number of colorings is $(1*60+3*4+2*0)/(1+3+2) = \boxed{\textbf{(D) } 12}$.


Solution 3

Note that the green disk has two possibilities; in a corner or on the side. WLOG, we can arrange these as [asy] filldraw(circle((0,0),1),green); draw(circle((2,0),1)); draw(circle((4,0),1)); draw(circle((1,sqrt(3)),1)); draw(circle((3,sqrt(3)),1)); draw(circle((2,2sqrt(3)),1));  draw(circle((8,0),1)); filldraw(circle((10,0),1),green); draw(circle((12,0),1)); draw(circle((9,sqrt(3)),1)); draw(circle((11,sqrt(3)),1)); draw(circle((10,2sqrt(3)),1)); [/asy] Take the first case. Now, we must pick two of the five remaining circles to fill in the red. There are $\dbinom{5}{2}=10$ of these. However, due to reflection we must divide this by two. But, in two of these cases, the reflection is itself, so we must subtract these out before dividing by 2, and add them back afterwards, giving $\frac{10-2}{2}+2=6$ arrangement in this case.

Now, look at the second case. We again must pick two of the five remaining circles, and like in the first case, two of the reflections give the same arrangement. Thus, there are also $6$ arrangements in this case.

In total, we have $6+6=\boxed{\text{\bf(D) }12}$.

Solution by tdeng

See Also

2017 AMC 10B (ProblemsAnswer KeyResources)
Preceded by
Problem 17
Followed by
Problem 19
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png