A Recursion Method of Solution for Occupancy Problems
William C. Hardy · SIAM Journal on Applied Mathematics · 1969
The model for the classical occupancy problem is an experiment in which a number of balls is randomly distributed among a fixed number of cells, and the question asked : “How many cells may we expect to contain k balls?” Standard solutions to this problem are obtained by more or less direct combinatorial computations. This paper exhibits a recursive solution, which the author has found to be quite useful for treating variations of the classical problems.