Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
In probability, the coupon collector's problem models "collect all the coupons and win" contests. In its simplest form, suppose n distinct types of coupon are equally likely to occur: what is the expected number of coupons we must draw to collect at least one of each type?
1
vote
In the coupon collector's problem with group drawings, why does the probability decrease wit...
While late to the game I believe I understand the issue you are having. The case is not, as the comments suggest, because the equation is for exactly the number of stickers, but rather due to the natu …