Extenstion of Coupon collector problem

X took N dices, numbered from 1 to N, shuffled them, took K of them randomly and then recorded their numbers and returned them to the pile. Then he repeated these steps:
shuffle them again, again took the K dices, and so on.

how many times he need to do so,that each dice has been taken at least once?

1 Like