Difference between revisions of "2017 AMC 10B Problems/Problem 18"
m |
|||
Line 63: | Line 63: | ||
Solution by tdeng | Solution by tdeng | ||
− | ==Solution: | + | ===Solution 4: Burnside's+Guessing, for if you are running out of time but want some free points=== |
− | By | + | By Burnside's, we quickly find the set <math>G</math> of all group actions that can be applied to one coloring to obtain another. <math>G={s_1,s_2, s_3,120^\circ,240^\circ, e}</math>, where all <math>s_k</math> are lines of reflection symmetry and <math>120^\circ,240^\circ</math> are the rotations, and <math>e</math> is the identity. Note that all <math>C(6,3)*C(3,2)=60</math> colorings are fixed by the identity. Let's say there are a total of <math>K</math> other fixed points (that let's say we don't have time to calculate) from the other group actions. Using Burnsides, we have <math>(60+K)/6=10+K/6</math>. At this point, we can clearly get rid of (A), (B), and (C). We have now narrowed down to two answers, and if you're lucky, you can guess <math>\boxed{\text{\bf(D) }12}</math> |
==See Also== | ==See Also== | ||
{{AMC10 box|year=2017|ab=B|num-b=17|num-a=19}} | {{AMC10 box|year=2017|ab=B|num-b=17|num-a=19}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 11:23, 23 November 2017
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
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 about 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 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 , , 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+Guessing, for if you are running out of time but want some free points
By Burnside's, we quickly find the set of all group actions that can be applied to one coloring to obtain another. , where all are lines of reflection symmetry and are the rotations, and is the identity. Note that all colorings are fixed by the identity. Let's say there are a total of other fixed points (that let's say we don't have time to calculate) from the other group actions. Using Burnsides, we have . At this point, we can clearly get rid of (A), (B), and (C). We have now narrowed down to two answers, and if you're lucky, you can guess
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.