The "coupon collection problem" refers to a class of occupancy problems,
in which j identical items are distributed, independently and at random,
to n cells, with no restrictions on multiple occupancy. Identifying the cells as
coupons, a coupon is "collected" if the cell is occupied by one or more of...