Coupon collecting from a binomial distribution. Develop a version of getCoupon() that uses binomial () from the previous exercise to return coupon values according to the binomial distribution with p = 1/2. Hint: Generate a uniformly random number x between 0 and 1, then return the smallest value of k for which the sum of f(n, j, p) for all j < k exceeds x. Extra credit: Develop a hypothesis for describing the behavior of the coupon collector function under this assumption.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.