2 0 % of the time and lies the rest of the time, Prisoner 2 tells the truth or a lie with equal probability, and Prisoner 3 tells the truth 1 0 9 of the time, and lies the rest. You decide to play a game. You arrange the prisoners in a line like so: Prisoner 1 , Prisoner 2 , Prisoner 3 . You go down the line, starting from Prisoner 1, and ask each of them a question. Whenever a prisoner tells the truth, you let them go, until only one remains. When the probability that Prisoner 1 is let go is expressed as a fraction in the form b a for coprime positive integers a and b , what is the value of a + b ?
There are three prisoners in a prison. Prisoner 1 tells the truth
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.
Good question, Josh. I looked at the cases (i) prisoner 2 is let go first followed by prisoner 3, and (ii) prisoner 3 is let go first followed by prisoner 2. The sum of the probabilities associated with these two cases is the probability that prisoner 1 is never let go, so I then took the complement of this result to get the probability that prisoner 1 is let go at some time. Same type of calculation as yours, but one less case to deal with.
Very nice casework which make approaching the problem much easier!
is that approaching to sequence??
It is useful to first describe and solve for a general game as follows: Let Player P be the first in line, who tells the truth with probability p . Furthermore, given Player P does not tell the truth, then let q be the probability Player P gets another try. We can use this model to describe games where there are 2 or 3 (or any number of) players.
Let x be the probability that Player P is the first player released from this game. First step analysis gives us that x = p + ( 1 − p ) q x . That is, we can break this down into two exclusive events. First, Player P can tell the truth on the first turn (probability p ). Second, Player P does not tell the truth on the first turn and the game gets around to Player P again. Since this is the exact same situation as the start of the game, the probability for this case is ( 1 − p ) q x .
Solving for x in terms of p and q gives us x = 1 − ( 1 − p ) q p . Note that the denominator looks messy, but it is simply 1 minus the probability that everyone lies once.
We now consider the two cases where Prisoner 1 is not released:
Case 1: Prisoner 2 is the first released and Prisoner 3 is the second released. The probability of this is the product of the following sequence of events:
Prisoner 1 lies on the first turn, giving Prisoner 2 a turn: 4 / 5 .
Prisoner 2 is first released: using p = 1 / 2 , q = 1 0 1 5 4 = 2 5 2 in our model, we get 2 5 / 4 8 .
This leaves Prisoner 1 and 3 with Prisoner 3 going first. Prisoner 3 is released first with probability (using p = 9 / 1 0 , q = 4 / 5 ) of 4 5 / 4 6 .
So the probability of Case 1 is 7 5 / 1 8 4 .
Case 2: Prisoner 3 is the first released and Prisoner 2 is the second released. The probability of this is the product of the following sequence of events:
Prisoners 1 and 2 lie on their first turn: 5 4 2 1 = 5 2 .
Prisoner 3 is first released: using p = 9 / 1 0 , q = 5 4 2 1 = 5 2 in our model, we get 1 5 / 1 6 .
Prisoner 1 lies on their next turn, giving Prisoner 2 another turn: 4 / 5 .
Prisoner 2 is released next: using p = 1 / 2 , q = 4 / 5 , this is probability 5 / 6 .
So the probability of Case 2 is 1 / 4 .
The total probability of these two cases is 1 2 1 / 1 8 4 . The probability that Prisoner 1 is released is the complement of this, 6 3 / 1 8 4 , giving an answer of 6 3 + 1 8 4 = 2 4 7 .
Problem Loading...
Note Loading...
Set Loading...
Let us have 3 cases: Case 1: Prisoner 1 is let go first Case 2: Prisoner 2 is let go first, Prisoner 1 is let go second Case 3: Prisoner 3 is let go first, Prisoner 1 is let go second
Clearly, the sum of the probabilities of all 3 of these cases will yield the answer.
The probability of Case 1 is 0 . 2 + 0 . 8 ⋅ 0 . 5 ⋅ 0 . 1 ⋅ 0 . 2 + 0 . 8 ⋅ 0 . 5 ⋅ 0 . 1 ⋅ 0 . 8 ⋅ 0 . 5 ⋅ 0 . 1 ⋅ 0 . 2 + ⋯ = 1 − 0 . 0 4 0 . 2 = 9 6 2 0 = 2 4 5 .
Case 2 has two parts. The probability that Prisoner 2 is let go first is 0 . 9 6 0 . 4 = 9 6 4 0 = 1 2 5 , and the probability that Prisoner 1 is let go after that is 0 . 1 ⋅ 0 . 2 + 0 . 1 ⋅ 0 . 8 ⋅ 0 . 1 ⋅ 0 . 2 + ⋯ = 0 . 9 2 0 . 0 2 = 9 2 2 = 4 6 1 , and the probability of Case 2 is 1 2 5 ⋅ 4 6 1 = 5 5 2 5 .
Case 3 also has two parts. The probability that Prisoner 3 is let go first is 0 . 9 6 0 . 3 6 = 8 3 , and the probability that Prisoner 1 is let go after that is 0 . 2 + 0 . 8 ⋅ 0 . 5 ⋅ 0 . 2 + 0 . 8 ⋅ 0 . 5 ⋅ 0 . 8 ⋅ 0 . 5 ⋅ 0 . 2 + ⋯ = 1 − 0 . 4 0 . 2 = 0 . 6 0 . 2 = 3 1 , and the probability of Case 3 is 8 3 ⋅ 3 1 = 8 1 .
Now, the sum of the probabilities is 2 4 5 + 5 5 2 5 + 8 1 = 2 3 5 + 8 1 = 1 8 4 6 3 , and 6 3 + 1 8 4 = 2 4 7 .