Difference between revisions of "2000 AMC 12 Problems/Problem 25"
m (→Solution 1) |
m (minor edit) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
Eight congruent [[equilateral triangle]]s, each of a different color, are used to construct a regular [[octahedron]]. How many distinguishable ways are there to construct the octahedron? (Two colored octahedrons are distinguishable if neither can be rotated to look just like the other.) | Eight congruent [[equilateral triangle]]s, each of a different color, are used to construct a regular [[octahedron]]. How many distinguishable ways are there to construct the octahedron? (Two colored octahedrons are distinguishable if neither can be rotated to look just like the other.) | ||
− | |||
− | |||
<center><asy> | <center><asy> | ||
Line 22: | Line 20: | ||
</asy></center> | </asy></center> | ||
− | == Solution 1 == | + | <math>\text {(A)}\ 210 \qquad \text {(B)}\ 560 \qquad \text {(C)}\ 840 \qquad \text {(D)}\ 1260 \qquad \text {(E)}\ 1680</math> |
+ | |||
+ | == Solutions == | ||
+ | === Solution 1 === | ||
Since the octahedron is indistinguishable by rotations, without loss of generality fix a face to be red. | Since the octahedron is indistinguishable by rotations, without loss of generality fix a face to be red. | ||
<center><asy> | <center><asy> | ||
Line 79: | Line 80: | ||
</asy></center> | </asy></center> | ||
− | == Solution 2 == | + | === Solution 2 === |
We consider the dual of the octahedron, the [[cube (geometry)|cube]]; a cube can be inscribed in an octahedron with each of its [[vertex|vertices]] at a face of the octahedron. So the problem is equivalent to finding the number of ways to color the vertices of a cube. | We consider the dual of the octahedron, the [[cube (geometry)|cube]]; a cube can be inscribed in an octahedron with each of its [[vertex|vertices]] at a face of the octahedron. So the problem is equivalent to finding the number of ways to color the vertices of a cube. | ||
Select any vertex and call it <math>A</math>; there are <math>8</math> color choices for this vertex, but this vertex can be rotated to any of <math>8</math> locations. After fixing <math>A</math>, we pick another vertex <math>B</math> adjacent to <math>A</math>. There are seven color choices for <math>B</math>, but there are only three locations to which <math>B</math> can be rotated to (since there are three edges from <math>A</math>). The remaining six vertices can be colored in any way and their locations are now fixed. Thus the total number of ways is <math>\frac{8}{8} \cdot \frac{7}{3} \cdot 6! = 1680 \Rightarrow \mathrm{(E)}</math>. | Select any vertex and call it <math>A</math>; there are <math>8</math> color choices for this vertex, but this vertex can be rotated to any of <math>8</math> locations. After fixing <math>A</math>, we pick another vertex <math>B</math> adjacent to <math>A</math>. There are seven color choices for <math>B</math>, but there are only three locations to which <math>B</math> can be rotated to (since there are three edges from <math>A</math>). The remaining six vertices can be colored in any way and their locations are now fixed. Thus the total number of ways is <math>\frac{8}{8} \cdot \frac{7}{3} \cdot 6! = 1680 \Rightarrow \mathrm{(E)}</math>. | ||
− | == Solution 3 == | + | === Solution 3 === |
There are 8! ways to place eight colors on a fixed octahedron. An octahedron has six vertices, of which one can face the top, and for any vertex that faces the top, there are four different triangles around that vertex that can be facing you. Thus there are 6*4 = 24 ways to orient an octahedron, and <math>8!/24 = 1680 \Rightarrow \mathrm{(E)}</math> | There are 8! ways to place eight colors on a fixed octahedron. An octahedron has six vertices, of which one can face the top, and for any vertex that faces the top, there are four different triangles around that vertex that can be facing you. Thus there are 6*4 = 24 ways to orient an octahedron, and <math>8!/24 = 1680 \Rightarrow \mathrm{(E)}</math> | ||
− | == See | + | == See Also == |
{{AMC12 box|year=2000|num-b=24|after=Last question}} | {{AMC12 box|year=2000|num-b=24|after=Last question}} | ||
[[Category:Intermediate Combinatorics Problems]] | [[Category:Intermediate Combinatorics Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 01:55, 19 October 2020
Problem
Eight congruent equilateral triangles, each of a different color, are used to construct a regular octahedron. How many distinguishable ways are there to construct the octahedron? (Two colored octahedrons are distinguishable if neither can be rotated to look just like the other.)
![[asy] import three; import math; unitsize(1.5cm); currentprojection=orthographic(2,0.2,1); triple A=(0,0,1); triple B=(sqrt(2)/2,sqrt(2)/2,0); triple C=(sqrt(2)/2,-sqrt(2)/2,0); triple D=(-sqrt(2)/2,-sqrt(2)/2,0); triple E=(-sqrt(2)/2,sqrt(2)/2,0); triple F=(0,0,-1); draw(A--B--E--cycle); draw(A--C--D--cycle); draw(F--C--B--cycle); draw(F--D--E--cycle,dotted+linewidth(0.7)); [/asy]](http://latex.artofproblemsolving.com/7/d/1/7d13f21ea69c61ec44e671434db41a0bdedb8189.png)
Solutions
Solution 1
Since the octahedron is indistinguishable by rotations, without loss of generality fix a face to be red.
![[asy] size(8cm); defaultpen(0.5); import three; import math; currentprojection=orthographic(2,0.2,1); triple A=(0,0,1); triple B=(sqrt(2)/2,sqrt(2)/2,0); triple C=(sqrt(2)/2,-sqrt(2)/2,0); triple D=(-sqrt(2)/2,-sqrt(2)/2,0); triple E=(-sqrt(2)/2,sqrt(2)/2,0); triple F=(0,0,-1); draw(A--B--E--cycle); draw(A--C--D--cycle); draw(F--C--B--cycle); draw(F--D--E--cycle,dotted+linewidth(0.7)); draw(surface(A--B--C--cycle),rgb(1,.6,.6),nolight);[/asy]](http://latex.artofproblemsolving.com/c/8/8/c88f77cd1f47ea3987a524e0a913959944cddccc.png)
There are ways to arrange the remaining seven colors, but there still are three possible rotations about the fixed face, so the answer is
.
![[asy] size(8cm); defaultpen(0.5); import three; import math; currentprojection=orthographic(2,0,1); triple A=(0,0,1); triple B=(sqrt(2)/2,sqrt(2)/2,0); triple C=(sqrt(2)/2,-sqrt(2)/2,0); triple D=(-sqrt(2)/2,-sqrt(2)/2,0); triple E=(-sqrt(2)/2,sqrt(2)/2,0); triple F=(0,0,-1); triple right=(0,1,0); picture p = new picture, r = new picture, s = new picture; draw(p,A--B--E--cycle); draw(p,A--C--D--cycle); draw(p,F--C--B--cycle); draw(p,F--D--E--cycle,dotted+linewidth(0.7)); draw(p,surface(A--B--C--cycle),rgb(1,.6,.6),nolight); draw(p,surface(A--B--E--cycle),rgb(1,1,.6),nolight); add(scale3(2.2)*p); draw(r,A--B--E--cycle); draw(r,A--C--D--cycle); draw(r,F--C--B--cycle); draw(r,F--D--E--cycle,dotted+linewidth(0.7)); draw(r,surface(A--B--C--cycle),rgb(1,.6,.6),nolight); draw(r,surface(A--C--D--cycle),rgb(1,1,.6),nolight); add(scale3(2.2)*shift(2*right)*r); draw(s,A--B--E--cycle); draw(s,A--C--D--cycle); draw(s,F--C--B--cycle); draw(s,F--D--E--cycle,dotted+linewidth(0.7)); draw(s,surface(A--B--C--cycle),rgb(1,.6,.6),nolight); draw(s,surface(B--C--F--cycle),rgb(1,1,.6),nolight); add(scale3(2.2)*shift(4*right)*s); [/asy]](http://latex.artofproblemsolving.com/1/3/7/13794d70fed69662b0c55408d02766344a410c75.png)
Solution 2
We consider the dual of the octahedron, the cube; a cube can be inscribed in an octahedron with each of its vertices at a face of the octahedron. So the problem is equivalent to finding the number of ways to color the vertices of a cube.
Select any vertex and call it ; there are
color choices for this vertex, but this vertex can be rotated to any of
locations. After fixing
, we pick another vertex
adjacent to
. There are seven color choices for
, but there are only three locations to which
can be rotated to (since there are three edges from
). The remaining six vertices can be colored in any way and their locations are now fixed. Thus the total number of ways is
.
Solution 3
There are 8! ways to place eight colors on a fixed octahedron. An octahedron has six vertices, of which one can face the top, and for any vertex that faces the top, there are four different triangles around that vertex that can be facing you. Thus there are 6*4 = 24 ways to orient an octahedron, and
See Also
2000 AMC 12 (Problems • Answer Key • Resources) | |
Preceded by Problem 24 |
Followed by Last question |
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.