Spain Mathematical Olympiad Problem 2

The figure shows a network of roads bounding 12 12 blocks. Person P P goes from A A to B , B, and person Q Q goes from B B to A , A, each going by a shortest path (along roads). The persons start simultaneously and go at the same constant speed. At each point with two possible directions to take, both have the same probability. The probability that the persons meet can be expressed as A B \frac{A}{B} where A A and B B are positive coprime integers. Find A + B A+B . This problem is part of this set .


The answer is 293.

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.

1 solution

Aalap Shah
Mar 31, 2015

The problem is fairly straightforward. Note that a 'shortest' path is comprised of exactly 3+4=7 edges. Now, let's say that both A and B move at a speed of 1m/s and that each edge is of length 1 metre . Then, the possible positions of A at different times (in seconds) will be as shown:

From this, and a similar consideration for B , it should be clear that they will meet at t=3.5 seconds at middle of the specific edges shown in the figure below:

I have labelled certain edges with the same symbol because they are symmetric with respect to each other. That is to say that whatever probability corresponds to the upper edge a also corresponds to the lower edge a . This is basically equivalent to switching the positions of A and B . This will help us simplify the problem. Now, consider the case where A and B meet at the mid-point of edge d . For this, A must reach the point (2,1) (with A as origin) through any of the dotted red lines (the continuous red path for example), from the figure below:

Thus, A has three possible paths to reach (2,1) Then, A must also choose the green path. At each junction, A has 2 choices, to go horizontal or to go vertical. Thus, the probability for this to occur is: P A , d = 3 ( 1 2 ) 3 ( 1 2 ) { P }_{ A,d }={ 3(\frac { 1 }{ 2 } ) }^{ 3 }{ (\frac { 1 }{ 2 } ) } Using similar notation for B : P B , d = 3 ( 1 2 ) 3 ( 1 2 ) { P }_{ B,d }={ 3(\frac { 1 }{ 2 } ) }^{ 3 }{ (\frac { 1 }{ 2 } ) } Thus, the probability of A and B to meet at d is: P d = P A , d . P B , d = 9 ( 1 2 ) 8 { P }_{ d }={ P }_{ A,d }.{ P }_{ B,d }={ 9(\frac { 1 }{ 2 } ) }^{ 8 } Note that the path that A and B choose after meeting does not affect this in any way. With similar reasoning, the other parts are easy: P c = 9 ( 1 2 ) 8 { P }_{ c }={ 9(\frac { 1 }{ 2 } ) }^{ 8 } P b = 3 ( 1 2 ) 8 { P }_{ b }={ 3(\frac { 1 }{ 2 } ) }^{ 8 } P a = ( 1 2 ) 7 { P }_{ a }={ (\frac { 1 }{ 2 } ) }^{ 7 } Finally, the required probability is: P = 2 P a + 2 P b + 2 P c + P d P={ 2P }_{ a }+{ 2P }_{ b }+{ 2P }_{ c }+{ P }_{ d } Substituting the values, we get: P = 37 256 P=\frac { 37 }{ 256 } Which gives the answer: 37 + 256 = 293 37+256=\boxed{293}

In my opinion, this should have been level 4.

Aalap Shah - 6 years, 2 months ago

Log in to reply

I agree, it should be level 3 or level 4 at best. I deferred solving this problem, to more leisurely time, assuming it to be relatively hard.

Pawan Kumar - 6 years, 2 months ago

I wonder what's wrong with folowing:

Each of them have ( 7 3 ) = 35 {7 \choose 3}= 35 ways to do all the path. So we have 35*35 pair of paths.

Now we count a ''good'' pair.

If they meet at a then each of them have 1 possible path so we have 1 pair.

If they meet at b then each of them have 3 possible paths so we have 9 pairs.

If they meet at c or d then each of them have 9 possible paths so we have 81 pairs.

So we have 263 good pairs. So A=263 and B =1225 ?

Kristijan Kocbek - 5 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...