Difference between revisions of "2006 AMC 12A Problems/Problem 20"
m (dup.) |
m (→Solution) |
||
| Line 16: | Line 16: | ||
Case 2b: the bug moves <math>G \to F</math>. There is a unique good path in this case, <math>F \to E \to G \to H</math>. | Case 2b: the bug moves <math>G \to F</math>. There is a unique good path in this case, <math>F \to E \to G \to H</math>. | ||
| − | Thus, all told we have 3 good paths after the first two moves, for a total of <math>3\cdot 3 \cdot 2 = 18</math> good paths. There were <math>3^7 = 2187</math> possible paths the bug could have taken, so the [[probability]] a random path is good is the [[ratio]] of good paths to total paths, <math>\frac{18}{2187} = \frac2{243} | + | Thus, all told we have 3 good paths after the first two moves, for a total of <math>3\cdot 3 \cdot 2 = 18</math> good paths. There were <math>3^7 = 2187</math> possible paths the bug could have taken, so the [[probability]] a random path is good is the [[ratio]] of good paths to total paths, <math>\frac{18}{2187} = \frac2{243}\Rightarrow \boxed{\mathrm (C)}</math>. |
== See also == | == See also == | ||
Revision as of 19:05, 18 February 2011
- The following problem is from both the 2006 AMC 12A #20 and 2006 AMC 10A #25, so both problems redirect to this page.
Problem
A bug starts at one vertex of a cube and moves along the edges of the cube according to the following rule. At each vertex the bug will choose to travel along one of the three edges emanating from that vertex. Each edge has equal probability of being chosen, and all choices are independent. What is the probability that after seven moves the bug will have visited every vertex exactly once?
Solution
Let us count the good paths. The bug starts at an arbitrary vertex, moves to a neighboring vertex (3 ways), and then to a new neighbor (2 more ways). So, without loss of generality, let the cube have vertex 
such that 
and 
are two opposite faces with 
above 
and 
above 
. The bug starts at and moves first to , then to 
.
From this point, there are two cases.
Case 1: the bug moves to 
. From , there is only one good move available, to 
. From , there are two ways to finish the trip, either by going 
or 
. So there are 2 good paths in this case.
Case 2: the bug moves to 
.
Case 2a: the bug moves 
. In this case, there are 0 good paths because it will not be possible to visit both and without double-visiting some vertex.
Case 2b: the bug moves 
. There is a unique good path in this case, 
.
Thus, all told we have 3 good paths after the first two moves, for a total of 
good paths. There were 
possible paths the bug could have taken, so the probability a random path is good is the ratio of good paths to total paths, 
.
See also
| 2006 AMC 12A (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 12 Problems and Solutions | |
| 2006 AMC 10A (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 10 Problems and Solutions | ||
