How many samples does it take to see all the balls in an urn?
Matematičeskie zametki, Tome 64 (1998) no. 1, pp. 58-63
Voir la notice de l'article provenant de la source Math-Net.Ru
Let an urn contain $N$ balls, numbered from 1 to $N$. A random number of balls are drawn without replacements from the urn, their numbers are noted and the balls are then returned to the urn. This is done repeatedly, the sample sizes being independent identically distributed. Let $v$ be the number of samples needed to see all the balls. A simple approximation for $Ev$ and the asymptotic distribution of $v$ as $N\to\infty$ are obtained.
@article{MZM_1998_64_1_a6,
author = {G. I. Ivchenko},
title = {How many samples does it take to see all the balls in an urn?},
journal = {Matemati\v{c}eskie zametki},
pages = {58--63},
publisher = {mathdoc},
volume = {64},
number = {1},
year = {1998},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1998_64_1_a6/}
}
G. I. Ivchenko. How many samples does it take to see all the balls in an urn?. Matematičeskie zametki, Tome 64 (1998) no. 1, pp. 58-63. http://geodesic.mathdoc.fr/item/MZM_1998_64_1_a6/