tiles. I want you to occupy the middlemost tile, the tile, and move on another tile in such a way there will always be unoccupied tiles. Please follow these steps:
I want to play a game. There areYou must pick randomly a ball from a box. There are balls in the box numbered with integers , , , …, . let be the number that you picked.
If divides , move one tile on your left. If not, move one tile on your right.
Return the ball into the box and shuffle
Repeat steps - until you are on the leftmost or the rightmost tile. If you are on the leftmost tile, you will lose and suffer but if you are on the rightmost tile, you will win and escape safely.
Based on this, the probability that you will win can be expressed as where and are positive coprime integers. Find
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.
No explanations have been posted yet. Check back later!