Nikhil the Ant

In a regular tetrahedron labeled A B C D ABCD , Nikhil the ant sits at vertex A A . After every minute, he travels to one of the other three vertices with equal probability. Given that the probability that after 7 7 minutes Nikhil is at vertex A A is m 729 \frac{m}{729} , find m m .


The answer is 182.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Otto Bretscher
Nov 4, 2015

Let us analyze this two-state Markov chain. Our main goal is to find a closed formula for the probability that Nikhil is at vertex A after n minutes.

Let p n = 1 4 + d n p_n=\frac{1}{4}+d_n be the probability that Nikhil finds itself at vertex A after n minutes, where 1 4 \frac{1}{4} is the equilibrium state and d n d_n is the deviation from the equilibrium. The probability that Nikhil isn't at A after n minutes is q n = 3 4 d n q_n=\frac{3}{4}-d_n so that p n + 1 = q n 3 = 1 4 d n 3 p_{n+1}=\frac{q_n}{3}=\frac{1}{4}-\frac{d_n}{3} . (The probability is 1/3 that the ant travels from a point other than A to A.) Note that d n + 1 = d n 3 d_{n+1}=-\frac{d_n}{3} . Starting from p 1 = 0 = 1 4 1 4 p_1=0=\frac{1}{4}-\frac{1}{4} , we find that d n = ( 1 ) n 4 3 n 1 d_n=\frac{(-1)^n}{4*3^{n-1}} and p n = 1 4 + d n = 1 4 ( 1 + ( 1 ) n 3 n 1 ) p_n=\frac{1}{4}+d_n=\frac{1}{4}\left(1+\frac{(-1)^n}{3^{n-1}}\right) In particular, we have p 7 = 182 729 p_7=\boxed{\frac{182}{729}} .

Wow that's intriguing. What would the general formula be if was is an octahedron instead (Nikhil would be traveling along edges)?

Alan Yan - 5 years, 7 months ago

Log in to reply

I believe it would be 1 6 ( 1 + ( 1 ) n 2 n 1 ) \frac{1}{6}\left(1+\frac{(-1)^n}{{2^{n-1}}}\right) , but I would have to double-check... now please don't let Nikhil run around an icosahedron ;)

Otto Bretscher - 5 years, 7 months ago
Alan Yan
Nov 4, 2015

A n = # of ways Nikhil will be at vertex A after n minutes. B n = # of ways Nikhil will be at any other vertex after n minutes. A n = B n 1 B n = 3 A n 1 + 2 B n 1 A n + 1 = 2 A n + 3 A n 1 A 1 = 0 A 2 = 3 A 3 = 6 A 4 = 21 A 5 = 60 A 6 = 183 A 7 = 546 \begin{aligned} A_n & = \text{\# of ways Nikhil will be at vertex A after n minutes.} \\ B_n & = \text{\# of ways Nikhil will be at any other vertex after n minutes.} \\ A_n & = B_{n-1} \\ B_n & = 3A_{n-1} + 2B_{n-1} \\ A_{n+1} & = 2A_{n} + 3A_{n-1}\\ A_1 & = 0 \\ A_2 & = 3 \\ A_3 & = 6 \\ A_4 & = 21 \\ A_5 & = 60 \\ A_6 & = 183 \\ A_7 & = 546 \end{aligned}

Thus the probability is 546 3 7 = 182 729 m = 182 . \frac{546}{3^7} = \frac{182}{729} \implies m = \boxed{182}.

Nice problem! A similar problem had appeared in INMO 2015 Question 4.

Pranshu Gaba - 5 years, 7 months ago

Log in to reply

In fact, actually, it is the exact same problem :P, just phrased differently.

Julian Poon - 5 years, 7 months ago

Log in to reply

I agree, it's the same problem! However the general form of the problems is different. I think the INMO problem with n n players is simpler as compared to the above problem with a polyhedron of n n vertices.

Pranshu Gaba - 5 years, 7 months ago

Log in to reply

@Pranshu Gaba But for the case of 4 4 people, the problem is pretty much identical. Personally, I think that a polyhedron might be easier in certain cases, such as a cube.

Julian Poon - 5 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...