Suppose that there is a collection of n uniformly distributed cards and for each packet there are m ≤ n (usually m << n) different cards.
Analyze the number of packets to buyto complete the collection in expectation and also in high probability.
Suppose that there is a collection of n uniformly distributed cards and for each packet there are m ≤ n (usually m << n) different cards.
Analyze the number of packets to buyto complete the collection in expectation and also in high probability.