Problem

1985 AIME Problem 12

Let A, B, C and D be the vertices of a regular tetrahedron, each of whose edges measures 1 meter. A bug, starting from vertex A, observes the following rule: at each vertex it chooses one of the three edges meeting at that vertex, each edge being equally likely to be chosen, and crawls along that edge to the vertex at its opposite end. Let p = \frac{n}{729} be the probability that the bug is at vertex A when it has crawled exactly 7 meters. Find the value of n.

Leading zeroes must be inputted, so if your answer is 34, then input 034


Full credit goes to MAA for authoring these problems. These problems were taken on the AOPS website.


Show/Hide Problem Tags

Problem Tags: Counting and probability Graph theory

Want to contribute problems and receive full credit? Click here to add your problem!
Please report any issues to us in our Discord server
Go to previous contest problem (SHIFT + Left Arrow) Go to next contest problem (SHIFT + Right Arrow)