Material Detail
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.
Quality
- User Rating
- Comments
- Learning Exercises
- Bookmark Collections
- Course ePortfolios
- Accessibility Info
More about this material
- Mobile Compatibility:
- Not specified at this time
- Language:
- English
- Cost Involved:
- No
- Source Code Available:
- No
- Accessibility Information Available:
- Unknown
- Creative Commons:
-
This work is licensed under a Attribution 3.0 United States
