The coupon collector problem calculates the expected number of days it takes to get n different coupons, if one receives one of the n coupons at random each day. The number of days is approximately n(0.577 + ln n). Use this to calculate the expected number of TCP connections a random port scan (scanning port numbers 0 through 1023) needs to eventually check all 1,024 well- known port numbers.
ANSWER:
The coupon collector problem calculates the expected number of days it takes to get n different coupons, if one receives one of the n coupons at random each day. The number of days is approximately n(...
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...