Probability Puzzles 1
Below are some probability puzzles.
-
There are 6 players, numbered 1 to 6. Player 1 rolls a die. If Player 1 rolls a 1, he wins and the game ends.
If Player 1 rolls any other number, the die is passed to the player corresponding to the rolled number, and the game continues with that player rolling. The game ends when a player rolls their own number.
Solution
-
A line of 100 airline passengers is waiting to board a plane. They each hold a ticket to one of the 100 seats on that flight. For convenience, let's say that the n th passenger in line has a ticket for seat number 'n'. Being drunk, the first person in line picks a random seat (equally likely for each seat). All of the other passengers are sober, and will go to their assigned seats unless it is already occupied; If it is occupied, they will then find a free seat to sit in, at random. What is the probability that the last (100th) person to board the plane will sit in their own seat (#100)?
Solution
-
Expected number of flip to get 2 heads in a row.
Solution
The answer is simple, let say the expected number is .
-
If we first flip the first tail, we need flips to get two heads, with prob = .
-
If we first flip the first head ():
-
probability to get a head. Than the total number of flips is .
-
probability to get a tail. Than the total number of flips is as we already wasted two flips.
-
Hance, .
-
-
Generalie to question 3, what if heads in a row?
Solution
Inspired by reference 2.
Denot as the expected number of flips to get heads in a row.
When we need to get 1 more head from , we have two cases:
-
We flip a head then we need more flips.
-
We flip a tail then we need more flips (One for the current useless flip)
Rearranging gives:
Let , we have . Hance
and
-
-
Expected number of steps for a drunk man to reach one end of the bridge.
Question from A Practical Guide to Quantitative Finance Interviews.
The drunk man initially stands as -th meter of a 100m long bridge, and it have 1/2 probability to move 1 meter left or right. What is the expected number of steps for him to reach either end of the bridge?
Solution
Observed that
Hence it is a martingale, and we can use the optional stopping theorem.
Let be the expected number of steps to reach either end of the bridge from -th meter, let be the probability of reaching the left end first.
Rearranging gives:
Using another martingale
gives
Rearranging gives:
