In the picture bellow: the bear want to go to the cell containing the honey jar, each time he move he go either to the up-left cell or up-right cell. However the bear prefer to go right more than to the left as shown.
What is the probability (in percentage) that the bear will go to the honey jar?
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.
Next problem. Where is pozition in upper line of the honey jar with maximum of the probability to meet with the bear?
Log in to reply
Letting x = 0 be the far left tile along the top and x = 6 be the far right tile along the top, then each probability is ( x 6 ) ( 4 1 ) 6 − x ( 4 3 ) x which leads to:
Pos | Probability |
0 | ( 0 6 ) ( 4 1 ) 6 − 0 ( 4 3 ) 0 ≈ 0 . 0 2 4 % |
1 | ( 1 6 ) ( 4 1 ) 6 − 1 ( 4 3 ) 1 ≈ 0 . 4 3 9 % |
2 | ( 2 6 ) ( 4 1 ) 6 − 2 ( 4 3 ) 2 ≈ 3 . 2 9 6 % |
3 | ( 3 6 ) ( 4 1 ) 6 − 3 ( 4 3 ) 3 ≈ 1 3 . 1 8 4 % |
4 | ( 4 6 ) ( 4 1 ) 6 − 4 ( 4 3 ) 4 ≈ 2 9 . 6 6 3 % |
5 | ( 5 6 ) ( 4 1 ) 6 − 5 ( 4 3 ) 5 ≈ 3 5 . 5 9 6 % |
6 | ( 6 6 ) ( 4 1 ) 6 − 6 ( 4 3 ) 6 ≈ 1 7 . 2 9 8 % |
which means position x = 5 (the tile second from the right) has the highest probability.
Log in to reply
Ok. Thanks for attention. And there is 3D problem for piramide from cubes with N floors. In this case four probabilitis P 0 , P 1 , P 2 , P 3 there are for transit from k-floor to (k+1)-floor , P 0 + P 1 + P 2 + P 3 = 1 Find position with maximum probability for floor number N.
Or 3D problem for piramide from spheres with N floors. In this case three probabilitis P 0 , P 1 , P 2 there are for transit from k-floor to (k+1)-floor , P 0 + P 1 + P 2 = 1 Find position with maximum probability for floor number N.
Log in to reply
@Yuriy Kazakov – Here are the probabilities for the first five floors of the square pyramid:
and it gets even more complicated after that (I couldn't come up with an explicit equation).
One observation using the 5th floor, 2nd row, and 2nd column as an example ( 4 P 0 3 P 2 + 1 2 P 0 2 P 1 P 3 ) is that P 0 3 P 2 is one path to that box with a coefficient of 3 ! 1 ! 4 ! = 4 because there are 4 steps with exponents 3 and 1 , and P 0 2 P 1 P 3 is another path to that box with a coefficient of 2 ! 1 ! 1 ! 4 ! = 1 2 because there are 4 steps with exponents 2 , 1 , and 1 .
Another observation is that the each kth floor contains all the terms of the expansion ( P 0 + P 1 + P 2 + P 3 ) k − 1
@Yuriy Kazakov – Here are the probabilities for the first five floors of the triangular pyramid:
The kth floor contains all the terms in the trinomial expansion ( P 0 + P 1 + P 2 ) k − 1 . See Pascal's Pyramid for more information on trinomial expansions.
Problem Loading...
Note Loading...
Set Loading...
There are 5 + 4 + 3 + 2 + 1 = ( 2 6 ) = 1 5 ways the bear can get to the honey:
Since each path requires 2 up-left steps and 4 up-right steps, the probability is 1 5 ( 4 1 ) 2 ( 4 3 ) 4 ≈ 2 9 . 6 6 3 % .