2006 AMC 12A Problems/Problem 20
- The following problem is from both the 2006 AMC 12A #20 and 2006 AMC 10A #25, so both problems redirect to this page.
Contents
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?
Solutions
Solution 1
Call this cube , with being the starting point.
Because in moves the bug has to visit the other vertices, the bug cannot revisit any vertex.
Therefore, starting at A, the bug has a chance of finding a good path to the next vertex, and call it .
Then, the bug has a chance of reaching a new vertex next. Call this . and are always on the same plane.
Now, we split cases.
In the first case, the bug goes to the vertex opposite on the space diagonal with probability .
Then, the bug has to visit on the plane of last, as there is no way in and out from .
Therefore, there is only way out of to get to last.
Therefore, there is a chance of finding a good path in this case.
In the second case, the bug goes to vertex on plane with a chance of .
The bug then has only way to go to a point on the opposite face, therefore having a probability.
Then, the bug has a choice of two vertices on the face opposite to .
This results in a probability of finding a good path to a point .
Then, there is only way out of to visit both other vertices on that face in moves.
Multiply the probabilities for this case to get .
Add the probabilities of these two cases together to get
Solution 2
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 vertices 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, .
Solution 3 (using the answer choices)
As in Solution 1, the bug can move from its arbitrary starting vertex to a neighboring vertex in 3 ways. After this, the bug can move to a new neighbor in 2 ways (it cannot return to the first vertex). The total number of paths (as stated above) is or . Therefore, the probability of the bug following a good path is equal to for some positive integer . The only answer choice which can be expressed in this form is .
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.