Difference between revisions of "2017 AMC 10B Problems/Problem 18"
m (→Solution 2) |
m (→Solution 2) |
||
Line 33: | Line 33: | ||
3. Rotate by <math>120^\circ</math> counterclockwise 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 <math>1</math>, <math>4</math>, and <math>6</math> will be the same. Similarly, the colors of circles <math>2</math>, <math>3</math>, and <math>5</math> will be the same. This is impossible, so this case gives us <math>0</math> fixed points per rotation. | 3. Rotate by <math>120^\circ</math> counterclockwise 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 <math>1</math>, <math>4</math>, and <math>6</math> will be the same. Similarly, the colors of circles <math>2</math>, <math>3</math>, and <math>5</math> will be the same. This is impossible, so this case gives us <math>0</math> fixed points per rotation. | ||
− | By Burnside's lemma, the total number of colorings is <math>(1 | + | By Burnside's lemma, the total number of colorings is <math>(1 \cdot 60+3 \cdot 4+2 \cdot 0)/(1+3+2) = \boxed{\textbf{(D) } 12}</math>. |
===Solution 3=== | ===Solution 3=== |
Revision as of 13:55, 7 August 2020
Contents
[hide]Problem
In the figure below, of the disks are to be painted blue, are to be painted red, and 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?
Solution 1
First we figure out the number of ways to put the blue disks. Denote the spots to put the disks as from left to right, top to bottom. The cases to put the blue disks are . For each of those cases we can easily figure out the number of ways for each case, so the total amount is .
Solution 2
Denote the discs as in the first solution. Ignoring reflections or rotations, there are colorings. Now we need to count the number of fixed points under possible transformations:
1. The identity transformation. Since this doesn't change anything, there are fixed points
2. Reflect on a line of symmetry. There are lines of reflections. Take the line of reflection going through the centers of circles and . Then, the colors of circles and must be the same, and the colors of circles and must be the same. This gives us fixed points per line of reflection
3. Rotate by counterclockwise 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 , , and will be the same. Similarly, the colors of circles , , and will be the same. This is impossible, so this case gives us fixed points per rotation.
By Burnside's lemma, the total number of colorings is .
Solution 3
Note that the green disk has two possibilities; in a corner or on the side. WLOG, we can arrange these as Take the first case. Now, we must pick two of the five remaining circles to fill in the red. There are 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 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 arrangements in this case.
In total, we have .
Solution by tdeng
Solution 4: Burnside's Lemma
We note that the group acting on the possible colorings is , where is a rotation and is a reflection. In particular, the possible actions are the identity, the and rotations, and the three reflections.
We will calculate the number of colorings that are fixed under each action. Every coloring is fixed under the identity, so we count fixed colorings. Note that no colorings are fixed under the rotations, since then the outer three and inner three circle must be the same color, which is impossible in our situation.
Finally, consider the reflection with a line of symmetry going through the top circle. Every fixed coloring is determined by the color of the top circle (either green or blue), and the color of the middle circles (either blue or red). Hence, there are colorings fixed under this reflection action. The other two actions are symmetric, so they also have fixed colorings. Hence, by Burnside's lemma, the number of unique colorings up to reflections and rotations is
See Also
2017 AMC 10B (Problems • Answer Key • Resources) | ||
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.