+ Reply to Thread
Results 1 to 2 of 2

Thread: Triple Coupon Collector's Problem

  1. #1
    Points: 222, Level: 4
    Level completed: 44%, Points required for next Level: 28

    Thanked 0 Times in 0 Posts

    Triple Coupon Collector's Problem

    I've been looking around for solutions to a certain variation of the Coupon Collector's Problem, but I haven't been able to find anything (and I'm not good enough at probability theory to solve it myself.)

    What if you need to collect 3 copies of each coupon to have a complete set? What is the average number of draws you need before you have them all? If you already have some number of coupons, how does that affect your projected draw requirements to finish your set?

  2. #2
    TS Contributor
    Points: 22,410, Level: 93
    Level completed: 6%, Points required for next Level: 940

    Thanked 565 Times in 537 Posts

    Re: Triple Coupon Collector's Problem


    So the problem is already solved quite a long time ago with asymptotic solution given as above. For small number of sets and coupons, it can be analysed by Markov Chain, may have better solution though as the number of states grow very quickly when the number increase.

+ Reply to Thread


Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts

Advertise on Talk Stats