- Thread starter
- #1

The definition: I have a jar with 2*N tea bags in it (N>0 obviously). The beginning condition is that the teabags are joined in pairs - so there are N pairs. At each selection I select an item at random - initially that will be a pair of bags, in which case I tear one off and put the other back. On later turns I randomly select either a single bag, which would then be used, or a pair of joined bags (if there are any left), in which case I tear one off and proceed as above. What is the probability distribution - and hence the expectation - for D, the number of "drawings" required before there are no paired bags left in the jar?

It is clear that the values for D can range from N (by happening to always select paired bags) to 2*N-1.

I can see some ways of getting recursion equations, but I suspect that this problem has a simple answer resulting from a more general formulation. Any quick answers? Thanks.