Difference between revisions of "2006 AMC 10A Problems/Problem 25"
m (2006 AMC 10A Problem 25 moved to 2006 AMC 10A Problems/Problem 25) |
m (added category and link to previous problem) |
||
| Line 6: | Line 6: | ||
== See Also == | == See Also == | ||
*[[2006 AMC 10A Problems]] | *[[2006 AMC 10A Problems]] | ||
| + | |||
| + | *[[2006 AMC 10A Problems/Problem 24|Previous Problem]] | ||
| + | |||
| + | [[Category:Introductory Geometry Problems]] | ||
Revision as of 15:04, 4 August 2006
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?
