The waiting time until first duplication

Publisher Website
Google Scholar
Abstract
Balls are drawn with replacement from an urn containing m distinguishable balls until a match is noted. The distribution of the number of drawings required is considered in the case where only the last k balls drawn are remembered. The asymptotic behavior of this distribution, as m and k become large, is investigated. Two further variants of the problem are suggested.

This publication has 1 reference indexed in Scilit:

  • E2203
    The American Mathematical Monthly, 1970