You play a game, and each time you win with probability p. You plan to play 5 games. However, if you win on the 5th game, you must keep playing until you lose.
a) find the expected number of games that you play,
b) find the expected number of games that you lose,
My attempt:
a) you must play at least 5; to see the number of games beyond that, you need to find the expected value of the sum of X, where X is whether or not you win on your ith try, i>5.
I came up with p * sum(1 - p)^i = p/(1-p) (1 / ( 1 - (1 - p)) = 1 / (1 - p). Since you already played 5 games, and you also had to win on the 5th try, the final expected number of games should be:
5 + p / (1-p);
b) Given my horrid attempt at part (a), I have no idea where to turn for part (b). I'll post again tomorrow, after thinking through it some more.
the sum is a hypergeometric progression, which hopefully you have been taught. i got:
if you dont believe that, see the spoiler:
Spoiler:
consider the related but different geometric progression, which has a well known sum:
differentiate both sides with respect to p
This gives us the required sum for our hypergeometric progression.
and hence
So the expected number of games:
I have no idea where to turn for part (b)
for (b), note that you are certain to lose exactly 1 game after your 4th turn has finished. So find the expected number of looses in the first 4 turns and add one.
Last edited by SpringFan25; July 25th 2011 at 05:11 AM.
the sum is a hypergeometric progression, which hopefully you have been taught. i got:
if you dont believe that, see the spoiler:
Spoiler:
consider the related but different geometric progression, which has a well known sum:
differentiate both sides with respect to p
This gives us the required sum for our hypergeometric progression.
and hence
So the expected number of games:
for (b), note that you are certain to lose exactly 1 game after your 4th turn has finished. So find the expected number of looses in the first 4 turns and add one.
I will attempt to disagree on your calculations and logic for part (a). Here is how I see it: We will have to play at least 5 games. So the expected value will look something like , where is an unknown constant. Let denote the number of games we play after the fifth turn. Then it follows that . I will use a relation that is widely known:
.
Firstly we should immediately see that . Since we will play at least 0 games after the fifth has finished. What about To play at least one more game after the fifth one we will have to win game number 5 and that happens with probability . Hence . With induction one should see that to play number of games one would have to win all the preceding games along with game number 5. Therefore . This gives:
.
The last equaltity is commonly known as we have a simple geometric series. Finally this will give us, if we let denote the number of games we play in total:
.
Please let me know if you find any mistakes. I working on part (b).
I'm done with (b). For (b): First we play four games, we will lose on average of those games. When we think about what happens in the fifth game and after then we will see that we can only lose at most one game. This is clear because either we lose game number 5 or we keep on playing until we lose, in either case there is only one loss. Hence the expected number off losses would be .
Lets make sure we agree on the rules. My interpretation of post #1 was:
You start by playing 5 games.
if you win game 5, you play another game. Otherwise you stop
if you win game 6, you play another game. Otherwise you stop
..etc
suppose p=0, so you are certain to loose every game. You will loose game 5 and stop. So you will definately only play 5 games. Your formula says you expect to play 6 games which is inconsistent. My formula gives the right answer of 5.
So the expected value will look something like 5+\alpha, where \alpha is an unknown constant. Let X denote the number of games we play after the fifth turn. Then it follows that \alpha = E[X]. I will use a relation that is widely known:
I would only agree that the lower bound on the value must be 5, but that constraint is satisfied by my function.
E(X) = \sum_{k=0}^{+\infty} P(X\ge k).
Firstly we should immediately see that P(X\ge 0)=1. Since we will play at least 0 games after the fifth has finished. What about P(X \ge 1)? To play at least one more game after the fifth one we will have to win game number 5 and that happens with probability p. Hence P(X\ge 1) = p. With induction one should see that to play k number of games one would have to win all the preceding k-1 games along with game number 5. Therefore P(X\ge k) = p^k. This gives:
The last equaltity is commonly known as we have a simple geometric series. Finally this will give us, if we let Y denote the number of games we play in total:
E[Y] = 5 + E[X] = 5 + \frac{1}{1-p} .
I cant comment on this as I've never seen the relationship you are trying to use.
Lets make sure we agree on the rules. My interpretation of post #1 was:
You start by playing 5 games.
if you win game 5, you play another game. Otherwise you stop
if you win game 6, you play another game. Otherwise you stop
..etc
suppose p=0, so you are certain to loose every game. You will loose game 5 and stop. So you will definately only play 5 games. Your formula says you expect to play 6 games which is inconsistent. My formula gives the right answer of 5.
I would only agree that the lower bound on the value must be 5, but that constraint is satisfied by my function.
I cant comment on this as I've never seen the relationship you are trying to use.
Your solution to (b) is fine.
Hmm. You are right. I wonder where my logic fails. When I look at it more closely I see that if p is nonzero then my answer will always be greater that 6. Howerver yours is always greater than 5. I see now what I did wrong though. The relation that I sued applies to random variables that takes values in the set and the formula was supposed to be
not . Which will give a better answer. My answer will then be
,
which works for the case. I will edit my post. Can never rely completely on my memory. The relation along with the proof can be found here: