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.
CodeGuru Home | VC++ / MFC / C++ | .NET / C# | Visual Basic | VB Forums | Developer.com |
Results 1 to 1 of 1
Thread: randomized algorithm
|
Click Here to Expand Forum to Full Width |