# Question: There are N distinct types of coupons and each time

There are N distinct types of coupons, and each time one is obtained it will, independently of past choices, be of type i with probability Pi, i = 1, . . . ,N. Let T denote the number one need select to obtain at least one of each type. Compute P{T = n}.

**View Solution:**## Answer to relevant Questions

Let X be a binomial random variable with parameters n and p. Show that Let X be a Poisson random variable with parameter λ. (a) Show that P{X is even} = 1/2[1 + e−2λ] by using the result of Theoretical Exercise 15 and the relationship between Poisson and binomial random variables. (b) ...Here is another way to obtain a set of recursive equations for determining Pn, the probability that there is a string of k consecutive heads in a sequence of n flips of a fair coin that comes up heads with probability p: (a) ...Let X be such that P{X = 1} = p = 1 − P{X = −1} Find c ≠ 1 such that E[cX] = 1. The annual rainfall (in inches) in a certain region is normally distributed with μ = 40 and σ = 4. What is the probability that, starting with this year, it will take over 10 years before a year occurs having a rainfall of ...Post your question