Difference between revisions of "2020 AMC 10A Problems/Problem 19"
(→Solution 2) |
(→Solution 2) |
||
| Line 49: | Line 49: | ||
== Solution 2 == | == Solution 2 == | ||
Swap the faces as vertices and the vertices as faces. Then, this problem is the same as | Swap the faces as vertices and the vertices as faces. Then, this problem is the same as | ||
| − | 2016 AIME I #3 | + | [https://artofproblemsolving.com/wiki/index.php/2016_AIME_I_Problems/Problem_3 2016 AIME I #3] |
which had an answer of <math>\boxed{\textbf{(E) } 810}</math>. | which had an answer of <math>\boxed{\textbf{(E) } 810}</math>. | ||
<math>\textbf{- Emathmaster}</math> | <math>\textbf{- Emathmaster}</math> | ||
Revision as of 18:08, 1 February 2020
Problem
As shown in the figure below, a regular dodecahedron (the polyhedron consisting of 
congruent regular pentagonal faces) floats in space with two horizontal faces. Note that there is a ring of five slanted faces adjacent to the top face, and a ring of five slanted faces adjacent to the bottom face. How many ways are there to move from the top face to the bottom face via a sequence of adjacent faces so that each face is visited at most once and moves are not permitted from the bottom ring to the top ring?
Diagram
![[asy] import graph; unitsize(5cm); pair A = (0.082, 0.378); pair B = (0.091, 0.649); pair C = (0.249, 0.899); pair D = (0.479, 0.939); pair E = (0.758, 0.893); pair F = (0.862, 0.658); pair G = (0.924, 0.403); pair H = (0.747, 0.194); pair I = (0.526, 0.075); pair J = (0.251, 0.170); pair K = (0.568, 0.234); pair L = (0.262, 0.449); pair M = (0.373, 0.813); pair N = (0.731, 0.813); pair O = (0.851, 0.461); path[] f; f[0] = A--B--C--M--L--cycle; f[1] = C--D--E--N--M--cycle; f[2] = E--F--G--O--N--cycle; f[3] = G--H--I--K--O--cycle; f[4] = I--J--A--L--K--cycle; f[5] = K--L--M--N--O--cycle; draw(f[0]); axialshade(f[1], white, M, gray(0.5), (C+2*D)/3); draw(f[1]); filldraw(f[2], gray); filldraw(f[3], gray); axialshade(f[4], white, L, gray(0.7), J); draw(f[4]); draw(f[5]); [/asy]](http://latex.artofproblemsolving.com/0/8/5/08541e5d1cec59e7dd49ea0bbdb45fe328dbecbb.png)
Solution
Since we start at the top face and end at the bottom face without moving from the lower ring to the upper ring or revisiting a face, our journey must consist of the top face, a series of faces in the upper ring, a series of faces in the lower ring, and the bottom face, in that order.
We have 
choices for which face we visit first on the top ring. From there, we have 
choices for how far around the top ring we go before moving down: 
or 
faces around clockwise, or faces around counterclockwise, or immediately going down to the lower ring without visiting any other faces in the upper ring. We then have 
choices for which lower ring face to visit first (since every upper-ring face is adjacent to exactly lower-ring faces) and then once again choices for how to travel around the lower ring. We then proceed to the bottom face, completing the trip.
Multiplying together all the numbers of choices we have, we get 
.
Solution 2
Swap the faces as vertices and the vertices as faces. Then, this problem is the same as
2016 AIME I #3
which had an answer of 
.
Video Solution
~IceMatrix
See Also
https://artofproblemsolving.com/wiki/index.php/2016_AIME_I_Problems/Problem_3
| 2020 AMC 10A (Problems • Answer Key • Resources) | ||
| Preceded by Problem 18 |
Followed by Problem 20 | |
| 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. 
