Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2017 AMC 12B Problems/Problem 13"

(→‎Solution 2: Burnside's Lemma)
Line 1: Line 1:
−
==Problem 13==
+
==Problem==
 
In the figure below, <math>3</math> of the <math>6</math> disks are to be painted blue, <math>2</math> are to be painted red, and <math>1</math> 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?
 
In the figure below, <math>3</math> of the <math>6</math> disks are to be painted blue, <math>2</math> are to be painted red, and <math>1</math> 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?
  

Revision as of 12:55, 15 February 2021

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?

[asy] size(100); pair A, B, C, D, E, F; A = (0,0); B = (1,0); C = (2,0); D = rotate(60, A)*B; E = B + D; F = rotate(60, A)*C; draw(Circle(A, 0.5)); draw(Circle(B, 0.5)); draw(Circle(C, 0.5)); draw(Circle(D, 0.5)); draw(Circle(E, 0.5)); draw(Circle(F, 0.5)); [/asy]

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

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 $6$ possible arrangements for the $3$ blue disks and $2$ red disks in the remaining available slots. Now, consider the case that the green disk is on an edge. This yields $6$ more possible arrangements for the $3$ blue disks and $2$ red disks in the remaining available slots. Thus, our answer is $6 + 6 = \boxed{\bold{(D)}\, 12}$

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 $6$ in total: $3$ rotations, $0$°, $120$°, and $240$°. Additionally, there are $3$ different reflections, which are over lines passing through the middle of disks $1$, $4$, and $6$. The $0$° rotation has the total number of diagrams fixed, which is $6!/3!\cdot2!=60$. The $120$° and $240$° rotations each have $0$ fixed diagrams, as one would need the same color for disks $1, 4, 6$ and the same color for disks $2, 3, 5,$ which isn't possible. Consider the reflection over the line passing through disk $1$. The green can be placed in $2$ places, disk $1$ or $5$, and then, the blue must go in either disks $2$ and $3$ or disks $4$ and $6$, so the number of fixed diagrams is $2\cdot2=4$. The other two reflections also have $4$ unique fixed diagrams. Therefore, applying Burnside's Lemma, we get $(60+4+4+4)/6 = \boxed{\bold{(D)}\, 12}$

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_12B_Problems/Problem_13&oldid=146848"