Click to See Complete Forum and Search --> : randomized algorithm


suganya c
January 12th, 2011, 08:07 AM
Hi all,
Can anyone help me to solve this coupon collector problem,

Let p(t) = Probability (atmost k copies of coupon1 are collected at time t)
If p(t)<= (1/2n), then prove that the expected time to get k+1 copies of all n coupons <=2t.