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)
Please don't hesitate to give a "thumbs up" for the answer in case the answer has helped you
Yes, it is correct.
We are talking of a particular coupon i
We choose a set of 10 coupons.
The 24 coupons ( without this coupon i) will not have coupon i , Out of the total 25
So, P(you will not get Coupon i from 10)
= 24C10 / 25C10
= 0.60
Q. Given 25 different type of coupons, one coupon is obtained each time. one set obtain...
Suppose there are 25 different types of coupons and suppose that each time one obtains a coupon, it is equally likely to be any of the 25 types. Compute the expected number of different types that are contained in a set of 10 coupons.
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 there are n type of coupons. Each new coupon collected is of type i with probability Pi, independently of any other collected coupon. Here, D=1 Pi = 1. Suppose k coupons are collected. Let A be the event that there is at least one coupon of type i among the k collected. For i #j, (1) Compute P(A|AU A;) (2) Compute P(A|Aj)
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...
Exercise 12.6 At each stage, one can either pay 1 and receive a coupon that is equally likely to be any of n types, or one can stop and receive a final reward of jr if one's current collection of coupons contains exactly j distinct types. Thus, for instance, if one stops after having previously obtained six coupons whose successive types were 2, 4, 2, 5, 4, 3, then one would have earned a net return of 4r -6. The...
1. Given below are marks obtained by 20 students out of 25 in Mathematics test. 21 23 19 17 12 15 15 17 17 19 23 23 21 21 25 25 21 19 19 19 Calculate: i. measures of central tendency. (9 marks) ii. range and semi inter-quartile range. (6 marks) iii. variance and determine the shape of skewness. (5 marks) (b) A factory produces components of which 1% is defective. The components are packed in boxes of 10. A...
Problem #3: A 5 year bond has semiannual coupons of 14% per annum. The continuously compounding yield is 19%. The bond has a face value of $300. You will be pricing the bond initially, and at future times throughout the life of the bond as it pulls to par at maturity, using the same continuously compounding yield throughout. Since the yield is given with continuous compounding, the usual formulas will not work without changing the yield to the equivalent discrete...
c++ please read all question edit the program to test different random sizes of the array and give me the time in a file will be like random size of the array and next to it the time it took for each size Im trying to do time analysis for Quick sort but i keep getting time = 0 also i want edit the program to test different random sizes of the array and give me the time in a...
Q#16) When you consider the model established by Shannon, order the items given below by priority. 1. A transmitter translates the symbols into something that could be sent over a transmission channel. II. An information source generates messages made of symbols. III. A receiver tries to recover the resulting symbols and to forward them to the destination node. IV. Some noise could be added to the channel. V. Compression, modulation or any other method could be used. | - |||...
7-10 There is a new lottery game where twelve numbers are chosen from the set of numbers from 1 to 24, with no repeats. One of the ways to win is to match ZERO numbers, the other way to win is to match ALL the numbers. Order does not matter. 7. Calculate the probability of getting all the numbers correct. Show the setup of the numbers, in case calculations go silly and also to show that you didn't just Google...