Timeline for Batched Coupon Collector Problem
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2019 at 2:19 | vote | accept | mhsnk | ||
| Jun 30, 2019 at 1:50 | answer | added | pre-kidney | timeline score: 7 | |
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Jan 25, 2016 at 7:01 | history | edited | mhsnk | CC BY-SA 3.0 |
added 16 characters in body
|
| Jan 24, 2016 at 2:55 | vote | accept | mhsnk | ||
| Jun 30, 2019 at 1:58 | |||||
| Jan 23, 2016 at 16:33 | answer | added | Douglas Zare | timeline score: 3 | |
| Jan 22, 2016 at 21:31 | answer | added | Brendan McKay | timeline score: 3 | |
| Jan 22, 2016 at 21:24 | comment | added | mhsnk | The question posed in that link is not assuming distinct batch items. However, that specific answer that I am referring to, has the assumption of distinct batch items. I defined $k$ as you suggested. Thanks! | |
| Jan 22, 2016 at 21:22 | history | edited | mhsnk | CC BY-SA 3.0 |
added 62 characters in body
|
| Jan 22, 2016 at 20:27 | comment | added | Douglas Zare | I guess by $k$ you mean the target number of coupons out of $n$, but you should define the notation you use. The linked question does not assume that the coupons in each batch are distinct. Are you assuming to the contrary that you get $b$ different coupons? | |
| Jan 22, 2016 at 19:29 | history | edited | mhsnk | CC BY-SA 3.0 |
added 52 characters in body
|
| Jan 22, 2016 at 19:22 | history | asked | mhsnk | CC BY-SA 3.0 |