TITLE: Expectation of number of trials before success in an urn problem without replacement
QUESTION [7 upvotes]: Possible Duplicate:
Expected number of draws until the first good element is chosen 

An urn contains $b$ blue balls and $r$ red balls. Balls are removed at random without replacement until the first blue ball is drawn. What is the expectation of the total number of balls drawn? The answer should be $\frac{b+r+1}{b+1}$ but I have not been able to prove it.
I know that this seems like an easy/classic problem but I tried brute force (definition of expectation) and got a sum that I'm not able to simplify. Then I tried looking up well known distributions but none of them works for this problem.

REPLY [8 votes]: Here's one approach perhaps better than brute-force, but not as elegant as Byron's answer ;). Denote the expectation is $E(b,r)$. Conditioning on whether the first drawn ball is blue or red, we can write:
$$
E(b,r) = \color{Blue}{\frac{b}{b+r} \cdot 1} + \color{Red}{\frac{r}{b+r} \cdot (1+E(b, r-1))}, \tag{1}
$$
where the color of the term reveals which of the two events we are conditioning on. (While conditioning on red, the factor $1+E(b, r-1)$ stands for the current trial plus the expected number of further trials to get success. Note that, at this stage, we picked a red ball from the urn; so the urn contains $b$ blue balls and $r-1$ red balls.) 
We can rewrite $(1)$ as
$$
E(b,r) = 1 + \frac{r}{b+r} \cdot E(b, r-1).
$$
Now, we can guess the correct answer (either by computing the first few values or by peeking at the answer) to be
$$
E(b,r) = \frac{b+r+1}{b+1},
$$
and verify it using induction on $r$. :-)  Note that, for the purposes of induction, we can regard $b$ as a fixed constant, and $r$ as the variable.