Ask Question
20 March, 12:20

There are k types of coupons. independently of the types of previously collected coupons, each new coupon collected is of type i with probability pi, ki = 1 pi = 1. if n coupons are collected, find the expected number of distinct types that appear in this set. (that is, find the expected number of types of coupons that appear at least once in the set of n coupons.)

+5
Answers (1)
  1. 20 March, 12:56
    0
    Let X be the expected number of distinct types of coupons in the collection of k coupons X = X1 + X2 + ... + Xx.
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “There are k types of coupons. independently of the types of previously collected coupons, each new coupon collected is of type i with ...” in 📙 Mathematics if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers