Difference between revisions of "2016 AIME I Problems/Problem 3"
Aleph null (talk | contribs) m (→Solution) |
(→Problem 3) |
||
| Line 1: | Line 1: | ||
==Problem 3== | ==Problem 3== | ||
| − | A <math>regular</math> <math>icosahedron</math> is a <math>20</math>-faced solid where each face is an equilateral triangle and five triangles meet at every vertex. The regular icosahedron shown below has one vertex at the top, one vertex at the bottom, an upper pentagon of five vertices all adjacent to the top vertex and all in the same horizontal plane, and a lower pentagon of five vertices all adjacent to the bottom vertex and all in another horizontal plane. Find the number of paths from the top vertex to the bottom vertex such that each part of a path goes downward or horizontally along an edge of the icosahedron, and no vertex is repeated. | + | A <math>regular</math> <math>icosahedron</math> is a <math>20</math>-faced solid where each face is an equilateral triangle and five triangles meet at every vertex. The regular icosahedron shown below has one vertex at the top, one vertex at the bottom, an upper pentagon of five vertices all adjacent to the top vertex and all in the same horizontal plane, and a lower pentagon of five vertices all adjacent to the bottom vertex and all in another horizontal plane. Find the number of paths from the top vertex to the bottom vertex such that each part of a path goes downward or horizontally along an edge of the icosahedron, and no vertex is repeated. |
| + | {{Image needed}} | ||
| + | |||
==Solution== | ==Solution== | ||
Think about each plane independently. From the top vertex, we can go down to any of 5 different points in the second plane. From that point, there are 9 ways to to another point within the second plane: rotate as many as 4 points clockwise or as many 4 counterclockwise, or stay in place. Then, there are 2 paths from that point down to the third plane. Within the third plane, there are 9 paths as well (consider the logic from the second plane) Finally, there is only one way down to the bottom vertex. Therefore there are <math>5*9*2*9*1=810</math> paths. | Think about each plane independently. From the top vertex, we can go down to any of 5 different points in the second plane. From that point, there are 9 ways to to another point within the second plane: rotate as many as 4 points clockwise or as many 4 counterclockwise, or stay in place. Then, there are 2 paths from that point down to the third plane. Within the third plane, there are 9 paths as well (consider the logic from the second plane) Finally, there is only one way down to the bottom vertex. Therefore there are <math>5*9*2*9*1=810</math> paths. | ||
Revision as of 22:16, 4 March 2016
Problem 3
A 
is a 
-faced solid where each face is an equilateral triangle and five triangles meet at every vertex. The regular icosahedron shown below has one vertex at the top, one vertex at the bottom, an upper pentagon of five vertices all adjacent to the top vertex and all in the same horizontal plane, and a lower pentagon of five vertices all adjacent to the bottom vertex and all in another horizontal plane. Find the number of paths from the top vertex to the bottom vertex such that each part of a path goes downward or horizontally along an edge of the icosahedron, and no vertex is repeated.
An image is supposed to go here. You can help us out by creating one and editing it in. Thanks.
Solution
Think about each plane independently. From the top vertex, we can go down to any of 5 different points in the second plane. From that point, there are 9 ways to to another point within the second plane: rotate as many as 4 points clockwise or as many 4 counterclockwise, or stay in place. Then, there are 2 paths from that point down to the third plane. Within the third plane, there are 9 paths as well (consider the logic from the second plane) Finally, there is only one way down to the bottom vertex. Therefore there are 
paths.
See also
| 2016 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 2 |
Followed by Problem 4 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
