(→Problem 1: Coupon Collector) |
|||
| Line 3: | Line 3: | ||
== Problem 1: Coupon Collector == | == Problem 1: Coupon Collector == | ||
| + | Each brand of candy bar has one coupon in it. There are <math>n</math> different coupons in total; getting at least one coupon of each type entitles you to a prize. Each candy bar you eat can have any one of the coupons in it, with all being equally likely. Let <math>X</math> be the (random) number of candy bars you eat before you have all coupons. What are the mean and variance of <math>X</math>? | ||
== Problem 2: Minimum of Exponentials == | == Problem 2: Minimum of Exponentials == | ||
Revision as of 07:51, 30 September 2008
Contents
Instructions
Homework 5 can be downloaded here on the ECE 302 course website.
Problem 1: Coupon Collector
Each brand of candy bar has one coupon in it. There are $ n $ different coupons in total; getting at least one coupon of each type entitles you to a prize. Each candy bar you eat can have any one of the coupons in it, with all being equally likely. Let $ X $ be the (random) number of candy bars you eat before you have all coupons. What are the mean and variance of $ X $?
