The tea bag problem: probability of extracting a single bag of tea Suppose you have a bunch of tea bags in a box, initially in pairs, like these:

Let us suppose the box initially contains only joined pairs of tea bags, say $N_0$ of them (thus making for a total of $2N_0$ tea bags).
Every time you want to make yourself a tea, you put a hand in the box and randomly extract a tea bag.
Sometimes you will find yourself with a joined pair, in which case you split it, take one for your tea, and put the other back into the box.
If you instead extract a single tea bag (which was already split before), you just take it.
Now if you ever happened to be in a similar situation, you will probably have noticed that after a while you will almost always extract single tea bags and seldolmly find doubles (which is not surprising of course).
The question is, what exactly is the probability $p_k$ of extracting a single tea bag, after $k$ tea bags have already been picked?
Suppose for this problem that each time there is an equal probability of extracting any of the tea bags, regardless of them being joined with another or not, so that after the first step (in which we necessarily extract and split a double) the probability of extracting a single bag is $p_1=\frac{1}{2N_0-1}$.
It is relatively easy, just by computing the values of $p_k$ for the first $k$s, to see that the answer to the problem is quite nice:
$$p_k = \frac{k}{2N_0 -1}.$$
How can we prove this?

An interesting variation of the problem is asking what happens if we instead consider the picking of a pair as a single event (instead that as two, as in the above considered case).
With this assumption the previous formula does not hold, as computing the first values of $p_k$ shows:
$$ p_1 = \frac{1}{N_0}, \\ p_2 = \frac{2(N_0-1)}{N_0^2} .$$

(This is a condensed version of @lulu 's answer.)
If in drawing${}_{k+1}\>$ I pick a certain bag $b$ then any other  bag, in particular the partner of $b$,  is among the $k$ previously drawn bags with probability
$${k\over 2N-1}\ .$$
