Difference between revisions of "2015 AMC 10B Problems/Problem 20"
(created page. no solution; included a cube in case someone wants it) |
(→Problem) |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
Erin the ant starts at a given corner of a cube and crawls along exactly 7 edges in such a way that she visits every corner exactly once and then finds that she is unable to return along an edge to her starting point. how many paths are there meeting these conditions? | Erin the ant starts at a given corner of a cube and crawls along exactly 7 edges in such a way that she visits every corner exactly once and then finds that she is unable to return along an edge to her starting point. how many paths are there meeting these conditions? | ||
| + | <math>\textbf{(A) }\text{6}\qquad\textbf{(B) }\text{9}\qquad\textbf{(C) }\text{12}\qquad\textbf{(D) }\text{18}\qquad\textbf{(E) }\text{24}</math> | ||
| + | |||
==Solution== | ==Solution== | ||
<asy> | <asy> | ||
Revision as of 00:34, 6 April 2015
Problem
Erin the ant starts at a given corner of a cube and crawls along exactly 7 edges in such a way that she visits every corner exactly once and then finds that she is unable to return along an edge to her starting point. how many paths are there meeting these conditions?
Solution
![[asy] import three; draw((1,1,1)--(1,0,1)--(1,0,0)--(0,0,0)--(0,0,1)--(0,1,1)--(1,1,1)--(1,1,0)--(0,1,0)--(0,1,1)); draw((0,0,1)--(1,0,1)); draw((1,0,0)--(1,1,0)); draw((0,0,0)--(0,1,0)); [/asy]](http://latex.artofproblemsolving.com/e/9/1/e917ab297aff8e811bd2cac6f2d0ba55a232d431.png)
See Also
| 2015 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 19 |
Followed by Problem 21 | |
| 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. 
