Expectation of Last Remaining Container You decide to play a holiday drinking game. You start with 100 containers of eggnog in a row. The 1st container contains 1 liter of eggnog, the 2nd contains 2 liters, all the way until the 100th, which contains 100 liters. You select a container uniformly at random and take a one liter sip from it. If the container is empty after taking this sip, you remove it from the row and select only from the remaining bottles. You continue this process until there is only 1 bottle remaining. What is the expected number of liters of eggnog in this last bottle? What is this as this as a function of n, the number of starting bottles?
I came up with this problem myself recently, and I'm not really sure how to approach it. I can find the conditional expectation of a bottle given that it is the last one remaining using linearity of expectations, but it's not clear to me how to use this to get the overall expectation. 
 A: EDIT This answer is valid only in the assumption that the probability of taking a sip from a bottle is proportional to the number of sips remaining. 
Let $\alpha$ be the number of ways we can arrange all the sips (even counting the one in the end that are not taken)
$$\alpha = \frac{(\sum\limits_{i=1}^{100} i)!}{\prod\limits_{i=1}^{100} (i!)} $$
(there are $\sum\limits_{i=1}^{100} i$ sips, and for the bottle $i$, $i!$ sips are "identical")
Let $N(m)$ be the number of ways to arrange all sips in a way that exactly $m$ sips of one bottle remain in the end is :
$$N(m) = \sum\limits_{l=m}^{100} \frac{(C_l^m) m! (\sum\limits_{i=1}^{100}i - l) (\sum\limits_{i=1}^{100}i -m -1)!}{\prod\limits_{i=1}^{100} (i!)}$$
(To understand the formula, you have to work backward. Consider the case where the bottle $l$ is the last bottle. Then there are $(C_l^m)$ ways to select the $m$ sips from that bottle that are taken last, and there are $m!$ ways to order them. The sip before the last one can not be from bottle $l$ since there are exactly $m$ sips left, hence the factor $(\sum\limits_{i=1}^{100} - l)$. After that, there are $(\sum\limits_{i=1}^{100}i -m -1)$ sips that can be arranged in any way.)
Let $P(m)$ be the probability of having exactly $m$ sips in the last bottle.
$$P(m) = \frac{N(m)}{\alpha} = \sum\limits_{l=m}^{100} \frac{(C_l^m)m!(\sum\limits_{i=1}^{100}i - l) (\sum\limits_{i=1}^{100}i -m -1)!}{(\sum\limits_{i=1}^{100} i)!}$$
Now, the expected number of remaining sips in the last bottle is only :
$E = \sum\limits_{m = 1}^{100} m P(m)$
A: You may think there is a group of numbers, with $k$ number $k$, $k = 1, 2, \ldots, n$, a total of $\frac {n(n+1)} {2}$ numbers in the group. Each permutation of numbers corresponding to a sequence of taking the bottles.
The total number of permutation is given by the multinomial coeffcient:
$$ \frac {\displaystyle \left(\frac {n(n+1)}{2}\right)!} {\displaystyle \prod_{k=1}^n k!}$$
The number of permutation given that the number $i$ is put at the end
$$ \frac {\displaystyle \left(\frac {n(n+1)}{2}-1\right)!} {\displaystyle \prod_{\substack{k=1 \\ k \neq i}}^n k! (i-1)!}$$
So the probability of having number $k$ at the end is
$$ \frac {\displaystyle 2k} {n(n+1)}, k = 1, 2, \ldots, n$$
Note that this has a more intuitive way to interpret: You may also consider fixing the first number - the number of permutation will be the same. The probability is equal to the number of the $k$th bottle divided by the total number of bottles.
Then the expectation is given by
$$ \sum_{k = 1}^n \frac {2k^2} {n(n+1)} = \frac {2} {n(n+1)} \times \frac {n(n+1)(2n+1) } {6} = \frac {2n+1} {3}$$
