In the Banach matchbox problem, find the probability that at the moment when the first box is emptied (as opposed to being found empty), the other box contains exactly k matches.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.