Answer:-
Given That:-
Suppose there are n type of coupons. Each new coupon collected is of type i with probability Pi, independently of any other collected coupon. Here, . Suppose k coupons are collected. Let Ai be the event that there is at least one coupon of type i among the k collected. For i j,
(1) Compute
The given conditional probability is computed using Bayes theorem here as:
Here,
means at least one of the coupon type: i or j has been pulled out. the probability of this event is computed as:
= 1 - Probability that none of the coupon types or have pulled out
Now probability that has been pulled is computed here as:
= 1 - Probability that has not been pulled out in all the k trials
Therefore using Bayes theorem now the probability is comupted here as:
(2) Compute P(Ai | Aj)
The probability here is computed using Bayes theorem as:
The numerator here is the probability that both coupon types: i and j have pulled in k trials.
Now putting this, we get the final probability here as:
Thank you for your supporting. please upvote my answer...
Suppose there are n type of coupons. Each new coupon collected is of type i with...
1. Suppose there are m 2 1 different types of coupons, and a total of n coupons is to be collected. Each new coupon collected is, independent of the past, a type i coupon with probability i, 1 < i< m. Define for i-1,... ,m, Х,-{ 0, otherwise 1, if at least one type i coupon is among the n collected, type Let X = Xut + x,n. Calculate E(X) and Var(X).
4. Suppose you continually collect coupons and that there are two different types of coupon, type A and type B. Suppose also that each time a new coupon is obtained it is a type A coupon with probability 1/3 and a type B coupon with probability 2/3, independently of what coupons you have collected so far. Let X be the number of coupons collected until you have at least one coupon of both types. (a) Find the probability mass function...
Suppose that there are 12 types of coupons and that each time one obtains a coupon, it is, independently of previous selections, equally likely to be any one of the 12 types. One random variable of interest is T, the number of coupons that needs to be collected until one obtains a complete set of at least one of each type. Determine the p.m.f. of T, P(T -n) based on the fact P(T- n) P(T> n-1) P(T> n) Suppose that...
Suppose an > 0 for n = 1,2,3,... Let An = %=1 a; for n = 1,2,3,..., Suppose &j=1 a; diverges. Show that: no aj diverges. {j=11taj wat AN an+j > 1-1 i=1 AN+) AN+k a Show that &j=1 N for k = 1,2,3,..., Hence show that I diverges. Show th: .-1 for n = 1,2,3,..., Hence show that Lj=, converges. C. An
Q. Given 25 different type of coupons, one coupon is obtained each time. one set obtain 10 coupon. The probability that the type i coupon is not in the set is 24C10/25C10. Is it right? (24C10 => combination) If wrong, please tell me the answer. (i is range 1~25. coupon type index)
3. Suppose (X1, ..., Xk) follows a multinomial distribution with size n and event probability Pi, i = 1, ..., k. (C-1 Xi = n and Li-l pi = 1). (a) Show Xi~ Binom(pi) for i = 1, ..., k. (b) Show X; + X; ~ Binom(pi + pj), for 1 <i, j <k and i # j. (c) Show Cov(Xi, X;) = -npipj. (Hint: V(X; + X;) = V(X;) + V(X;) + 2Cov(Xi, X;)).
Problem 1. Stanislaw is collecting coupons. Each day he receives randomly one of n distinct coupons with equal probabilities (independently of other days (a) Let T be the number of days it takes Stanislaw to obtain a complete set. Explain why T can be written as a sum of n independent Geometric random variables and say what their parameters are (b) Compute the expected value of T. (Use the fact that the expectation of a sum of random variables is...
2. We distribute n points uniformly and independently on the circumference of a circle, and want to compute the probability that there is a semicircle that contain all of them. (In other words, the probability that there is a line through the center of the circle such that all n points lie on the same side of this line.) Let E be the event that such a semicircle exists. Denote by Pi, P2, ..., Pn the random points, and by...
2. Consider the coupon game from the lecture slides. (Recall that the strategy C means "print coupons", and N means "do not print coupons".) Firm 2 15, 15 Firm 25, 10 20, 20 10, 25 a. Suppose that instead of playing this game only once, the firms play it every week for 2 years (104 times). Is any outcome possible in which - at least sometimes - the firms cooperate with each other (do not print coupons)? Explain why or...
Suppose (X1, ..., Xk) follows a multinomial distribution with size n and event probability pi, i = 1, ..., k. O , X; = n and k pi = 1) (a) Show X; ~ Binom(Pi) for i = 1, ..., k. (b) Show X1 + X; ~ Binom(Pi + Pj), for 1 Sinj 5 k and i øj. (c) Show Cov(Xi, X;) = -npipj. (Hint: V(X; + X;) = V(X;) + V(X;) + 2Cov(Xi, X;)).