In a regular tetrahedron labeled A B C D , Nikhil the ant sits at vertex A . After every minute, he travels to one of the other three vertices with equal probability. Given that the probability that after 7 minutes Nikhil is at vertex A is 7 2 9 m , find m .
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.
Wow that's intriguing. What would the general formula be if was is an octahedron instead (Nikhil would be traveling along edges)?
Log in to reply
I believe it would be 6 1 ( 1 + 2 n − 1 ( − 1 ) n ) , but I would have to double-check... now please don't let Nikhil run around an icosahedron ;)
A n B n A n B n A n + 1 A 1 A 2 A 3 A 4 A 5 A 6 A 7 = # of ways Nikhil will be at vertex A after n minutes. = # of ways Nikhil will be at any other vertex after n minutes. = B n − 1 = 3 A n − 1 + 2 B n − 1 = 2 A n + 3 A n − 1 = 0 = 3 = 6 = 2 1 = 6 0 = 1 8 3 = 5 4 6
Thus the probability is 3 7 5 4 6 = 7 2 9 1 8 2 ⟹ m = 1 8 2 .
Nice problem! A similar problem had appeared in INMO 2015 Question 4.
Log in to reply
In fact, actually, it is the exact same problem :P, just phrased differently.
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 players is simpler as compared to the above problem with a polyhedron of n vertices.
Log in to reply
@Pranshu Gaba – But for the case of 4 people, the problem is pretty much identical. Personally, I think that a polyhedron might be easier in certain cases, such as a cube.
Problem Loading...
Note Loading...
Set Loading...
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 = 4 1 + d n be the probability that Nikhil finds itself at vertex A after n minutes, where 4 1 is the equilibrium state and d n is the deviation from the equilibrium. The probability that Nikhil isn't at A after n minutes is q n = 4 3 − d n so that p n + 1 = 3 q n = 4 1 − 3 d n . (The probability is 1/3 that the ant travels from a point other than A to A.) Note that d n + 1 = − 3 d n . Starting from p 1 = 0 = 4 1 − 4 1 , we find that d n = 4 ∗ 3 n − 1 ( − 1 ) n and p n = 4 1 + d n = 4 1 ( 1 + 3 n − 1 ( − 1 ) n ) In particular, we have p 7 = 7 2 9 1 8 2 .