Material Detail

Coupon Collector Experiment

Coupon Collector Experiment

This resource consists of a Java applet and expository text. The applet is a simulation of the coupon collector problem, which consists of sampling from the first m positive integers, with replacement, until k distinct values are obtained. The parameters m and k can be varied. The random variable of interest is the size of the sample.


  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material


Log in to participate in the discussions or sign up if you are not already a MERLOT member.