Difference between revisions of "1985 AIME Problems/Problem 12"

Revision as of 10:14, 14 July 2016

Problem

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$ .

Solution

Solution 1

Let $P(n)$ denote the probability that the bug is at $A$ after it has crawled $n$ meters. Since the bug can only be at vertex $A$ if it just left a vertex which is not $A$ , we have $P(n + 1) = \frac13 (1 - P(n))$ . We also know $P(0) = 1$ , so we can quickly compute $P(1)=0$ , $P(2) = \frac 13$ , $P(3) = \frac29$ , $P(4) = \frac7{27}$ , $P(5) = \frac{20}{81}$ , $P(6) = \frac{61}{243}$ and $P(7) = \frac{182}{729}$ , so the answer is $182$ . One can solve this recursion fairly easily to determine a closed-form expression for $P(n)$ .

Solution 2

We can find the number of different times the bug reaches vertex $A$ before the 7th move, and use these smaller cycles to calculate the number of different ways the bug can end up back at $A$ .

Define $f(x)$ to be the number of paths of length $x$ which start and end at $A$ but do not pass through $A$ otherwise. Obviously $\displaystyle f(1) = 0$ . In general for $f(x)$ , the bug has three initial edges to pick from. From there, since the bug cannot return to $A$ by definition, the bug has exactly two choices. This continues from the 2nd move up to the $(x-1)$ th move. The last move must be a return to $A$ , so this move is determined. So $\displaystyle f(x) = 2^{x-2}3$ .

Now we need to find the number of cycles by which the bug can reach $A$ at the end. Since $\displaystyle f(1) = 0$ , $f(6)$ cannot be used since on the 7th move the bug cannot move from $A$ to $A$ . So we need to find the number of partitions of 7 using only 2,3,4,5, and 7. These are $f(2)f(2)f(3)$ , $f(2)f(5)$ , $f(3)f(4)$ , and $f(7)$ . We can calculate these and sum them up using our formula. Also, order matters, so we need to find the number of ways to arrange each partition.

$\displaystyle {3\choose1}f(2)f(2)f(3) + {2\choose1}f(2)f(5) + {2\choose1}f(3)f(4) + f(7)$
$\displaystyle = 3(3)(3)(2\cdot3) + 2(3)(2^33) + 2(2\cdot3)(2^23) + (2^53)$
$= 546$

Finally, this is a probability question, so we divide by $3^7$ : $\displaystyle \frac{546}{3^7} = \frac{182}{3^6}$ .

Solution 3

There exists a simple heuristic method to arrive at the answer to this question, due to Simon Rubinstein-Salzedo, as follows: after a couple of moves, the randomness of movement of the bug and smallness of the system ensures that we should expect its probability distribution to be very close to uniform. In particular, we would expect $P(n)$ to be very close to $\frac 14$ for decently-sized $n$ , for example $n = 7$ . (In fact, from looking at the previous solution we can see that it is already close when $n = 3$ , and in fact the earlier values are also the best possible approximations given the restraints on where the bug can be.) Since we know the answer is of the form $\frac n{729}$ , we realize that $n$ must be very close to $\frac{729}{4} = 182.25$ , as indeed it is.

@@ Line 22: / Line 22: @@
 == See also ==
+*[[2003 AIME II Problems/Problem 13]] - very similar problem with an equilateral triangle
 {{AIME box|year=1985|num-b=11|num-a=13}}
 * [[AIME Problems and Solutions]]

1985 AIME (Problems • Answer Key • Resources)
Preceded by Problem 11	Followed by Problem 13
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search