2017 AMC 12B Problems/Problem 13
Problem 13
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
Looking at the answer choices, we see that the possibilities are indeed countable. Thus, we will utilize that approach in the form of two separate cases, as rotation and reflection take care of numerous possibilities. First, consider the case that the green disk is in a corner. This yields possible arrangements for the blue disks and red disks in the remaining available slots. Now, consider the case that the green disk is on an edge. This yields more possible arrangements for the blue disks and red disks in the remaining available slots. Thus, our answer is
Solution by akaashp11
Solution 2 (Burnside's Lemma)
Burnside's Lemma can be applied to the problem. Number the disks 1-6 from top to bottom and left to right. First, we count the number of group actions. There are in total: rotations, °, °, and °. Additionally, there are different reflections, which are over lines passing through the middle of disks , , and . The ° rotation has the total number of diagrams fixed, which is . The ° and ° rotations each have fixed diagrams, as one would need the same color for disks and the same color for disks which isn't possible. Consider the reflection over the line passing through disk . The green can be placed in places, disk or , and then, the blue must go in either disks and or disks and , so the number of fixed diagrams is . The other two reflections also have unique fixed diagrams. Therefore, applying Burnside's Lemma, we get
Solution by Aadileo
See Also
2017 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 12 |
Followed by Problem 14 |
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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.