Alice and Bob stand on opposite vertices of a regular octahedron. At the beginning of every minute,
The expected value of the number of minutes until they meet up is equal to q p , where p and q are coprime positive integers.
Find the value of p + q .
Note
: It is possible that they would meet at a vertex
or
at the midpoint of an edge.
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.
All that time working it out and failing, I had been forgetting that meeting on the edge would account for only half a minute, tiny detail, all the errors!
What category do these type of problems fall into? I am asking because I had studied probability extensively in my under grad. program but I have never come across such a problem
Log in to reply
Try hunting for information about Markov Chains. This problem has four states: Opposite, Adjacent, Meet at Vertex, Meet Halfway. The last two are absorbing.
Look at random walks. With discrete problems like these the problem is to work out how to get from A to B by reference to where you are at a given point in time. One example being a fly walking randomly along the vertices of a cube reaching the opposite side. Once you have defined all the possible states - in this case A and B are either opposite to or next to each other while the hypothetical fly is either 3,2, or 1 steps from the goal. But it all boils down to simultaneous equations in these types of problems.
I have spent a literal hour on this problem.
And when I figured it out, I was screaming.
Thank you for the nice problem, it was a nice time struggling with logics. xD
Log in to reply
Haha, thanks! It's nice to hear that you were challenged by this but still managed to figure it out! :-)
There a possibility though, however small, that they will keep moving in the same direction separated by one move and never meet. Given 2 randomly acting people, I can't see how can you calculate with certainty, the number of minutes it will take until they meet. Isn't the best you can do, to approximate the probability that they will meet after X minutes?
Log in to reply
But the probability that they never meet is 0 . If p 1 is the probability that they never meet, given that they are in State 1, and p 2 is the probability that they never meet, given that they are in State 2, then p 1 p 2 = 4 1 p 1 + 2 1 p 2 = 1 6 1 1 p 1 + 8 1 p 2 and hence p 1 = p 2 = 0 .
This is just like saying that if you keep tossing a fair coin, then you are certain to get a Head sometime. The probability of an infinite number of Tails is 0 .
I got the correct fraction and screwed up the last step. Wondering why adding 51 and 11 is so difficult :(
Very nicely written solution to an equally intriguing problem. Kudos!
Problem Loading...
Note Loading...
Set Loading...
Let us consider two states:
In state #1, Alice and Bob are on opposite vertices of the octahedron, i.e. they are separated by a distance of 2 edge lengths. In state #2, Alice and Bob are on adjacent vertices of the octahedron i.e. they are separated by a distance of 1 edge length.
Let T 1 denote the expected amount of time for Alice and Bob to meet each other given that they are in state #1, and define T 2 similarly for state #2. Our goal is to find the value of T 1 , since Alice and Bob start out on opposite vertices of the octahedron.
We can find that, after Alice and Bob choose a vertex, it takes 2 1 minutes for them to meet up if they meet up in the middle of an edge, 1 minute if they meet up at a vertex, T 1 + 1 minutes if they end up in state #1, and T 2 + 1 minutes if they end up in state #2.
When Alice and Bob are in state #1, there is a 4 1 probability that they meet up at a vertex; a 4 1 probability that they will end up back in state #1; and a 2 1 probability that they will end up in state #2. Thus,
T 1 = 4 1 ( 1 ) + 4 1 ( T 1 + 1 ) + 2 1 ( T 2 + 1 ) .
When Alice and Bob are in state #2, there is a 1 6 1 probability that they meet up in the middle of an edge; a 8 1 probability they will meet up at a vertex; a 1 6 1 1 probability that they will end up back in state #2; and a 8 1 probability that they will end up in state #1. Thus,
T 2 = 1 6 1 ( 2 1 ) + 8 1 ( 1 ) + 1 6 1 1 ( T 2 + 1 ) + 8 1 ( T 1 + 1 ) .
This gives us a system of equations for T 1 and T 2 . Solving for T 1 yields T 1 = 1 1 5 1 , so p + q = 6 2 .