A group of people want to play basketball. Unfortunately, there is only one ball available, so they decided to split into three teams, named A, B, and C, of players each, and agreed on the following rules:
They will play a total of games. Each game will be played between two teams.
Teams A and B will play the first game, and team C sits out.
Whenever a game is finished, the losing team sits out, and the team that sat out during the game plays the following game with the winning team. Assume that there are no draws.
Suppose that the teams are equally good at playing basketball—i.e. the probability of any team winning against any other team is .
The expected number of games that team C gets to play (does not sit out) can be expressed as a fraction , where are co-prime positive 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.
Let's consider the number of games for which each team is expected to sit out.
Let E A ( x ) denote the expected number of games for which team A sits out in the first x games. Let E B ( x ) and E C ( x ) denote the same value for teams B and C respectively. In essence, E A ( x ) denotes the value for a team that plays the first game, and E C ( x ) denotes that for a team that sits out the first game.
Notice that E A ( x ) = E B ( x ) and that E A ( x ) + E B ( x ) + E C ( x ) = x . This means that E C ( x ) = x − 2 E A ( x ) .
It is clear that E C ( 1 ) = 1 . After the first game, either team A or team B sits out, each with a probability of 2 1 . Therefore, E C ( x + 1 ) = 1 + 2 1 E A ( x ) + 2 1 E B ( x ) = 1 + E A ( x ) .
Since E A ( x ) = 2 x − E C ( x ) , E C ( x + 1 ) = 1 + 2 x − E C ( x ) = 1 + 2 x − 2 E C ( x ) .
We can then solve this recurrence relation.
E C ( x ) can be expressed in the form of q 1 k x + q 2 x + q 3 .
From the recurrence relation, we can see that 2 E C ( x ) + E C ( x + 1 ) = 1 + 2 x
We can get q 1 ( 2 k x + k x + 1 ) + q 2 ( 2 3 x + 1 ) + 2 3 q 3 = 1 + 2 x after substitution.
It is clear that q 2 = 3 1 from comparing the coefficients for x .
The equation then becomes q 1 ( 2 k x + k x + 1 ) + 2 3 q 3 = 3 2 .
The first term of the left hand side has to be constant no matter what x is. This means that k = − 2 1 (The term is constant when k = 0 or 1 as well. However, both of these values lead to the result E C ( x ) = 3 1 x + 3 2 , which does not satisfy the recurrence condition).
The equation now becomes 2 3 q 3 = 3 2 , giving q 3 = 9 4 .
We know that E C ( 1 ) = 1 , which means that q 1 k + q 2 + q 3 = 1 . Substituting the values, we can get q 1 = − 9 4 .
Therefore, E C ( 1 0 ) = − 9 4 ( − 2 1 ) 1 0 + 3 1 ( 1 0 ) + 9 4 = 2 5 6 9 6 7 .
So the expected number of games that team C does not sit out is 1 0 − 2 5 6 9 6 7 = 2 5 6 1 5 9 3 , giving the answer of 1 5 9 3 + 2 5 6 = 1 8 4 9 .