I saw this problem:
There is an urn with $a$ red and $a$ blue balls. We are drawing from it without replacement until we have drawn all the blue balls (we know there are $a$ of them). What is the expected value of the number of balls remaining in the urn?
This can be solved by taking $a+ (a-1) {a \choose 1} + (a-2) {a+1 \choose 2}+\dotsb+1 {2a-2 \choose a-1 } $ and applying the identity $\sum_{i=0}^{k} {n+i \choose i}= {n+k+1 \choose k} $ multiple times. It gives $\frac {2a \choose a+1} {2a \choose a}$ which simplifies to $\frac {a}{a+1}$.
Is there a reasoning that produces this result directly?
I also have a heuristic, non-combinatorial approach.
This problem can be recast as a boxes and balls problems.
Imagine that you lay out all $a$ blue balls in a row. You have $a$ red balls in your hand. Imagine that there are "boxes" between the blue balls and two "boxes" at the ends of the row. Let $I_j$ indicate whether or not the ball $j$th red ball was thrown into the last box. We can pretend that this last box is the urn that contains the number of red balls $X$ remaining after we've drawn the last blue one. Notice that the probability that a particular red ball is thrown into the last bin is $\frac{1}{a+1}$. Then $$E[X] = E\left[\sum_{j = 1}^a I_j\right] = a P(I_j = 1) = \frac{a}{a+1}.$$