 The problem is relevant to several hashing algorithms analyzed by Donald Knuth in his book "The Art of Computer Programming".It may be shown that if one samples uniformly, with replacement, from a population of size , the number of trials required for the first repeated sampling of "some" individual has expected value , where

The function

has been studied by Srinivasa Ramanujan and has asymptotic expansion