(→Problem 2: Minimum of Exponentials) |
(→Problem 3: Random Chord) |
||
| Line 10: | Line 10: | ||
== Problem 3: Random Chord == | == Problem 3: Random Chord == | ||
| + | A circle has radius <math>r</math>. Any chord of the circle is at distance at most <math>r</math> from the center. A random chord is drawn by first choosing its distance <math>D</math> from the center uniformly from the interval <math>[0,r]</math>, and then choosing any chord at that distance from the center. Find the PDF of <math>L</math>, the length of the chord. Draw a figure to illustrate. | ||
== Problem 4: Fire Station == | == Problem 4: Fire Station == | ||
Revision as of 06:54, 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 $?
Problem 2: Minimum of Exponentials
- (a) $ X_1 $ is an exponential random variable with parameter $ \lambda_1 $, and $ X_2 $ with $ \lambda_2 $. Let $ Y = \min(X_1,X_2) $. What is the PDF of $ Y $? Is $ Y $ one of the common random variables?
- (b) Use induction to show that the minimum of $ n $ exponential random variables with parameter 1 is an exponential random variable with paramter $ n $.
Problem 3: Random Chord
A circle has radius $ r $. Any chord of the circle is at distance at most $ r $ from the center. A random chord is drawn by first choosing its distance $ D $ from the center uniformly from the interval $ [0,r] $, and then choosing any chord at that distance from the center. Find the PDF of $ L $, the length of the chord. Draw a figure to illustrate.
