[algogeeks] Coupon collector problem(Randomized algorithm problem)

Hi all, Can someone help me to solve this randomized algorithm related puzzle? 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. With regards, Sugi -- You received this mes

[algogeeks] Coupon collector problem(Randomized algorithm problem)

Hi all, Can someone help me to solve this randomized algorithm related puzzle? 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. -- You received this message because you are sub