Timeline for Partitioning the coupons collected in the classical coupon collector's problem
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 16, 2018 at 16:27 | comment | added | Penelope Benenati | OK Henry, done. | |
| Apr 16, 2018 at 16:25 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
added 408 characters in body
|
| Apr 15, 2018 at 18:09 | comment | added | Henry | Could you give a toy example with small $m$ and $n$ so your definitions are clearer? For example $m=3$, $n=2$ and $k=1,2$ | |
| Apr 14, 2018 at 18:00 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
deleted 35 characters in body
|
| Apr 14, 2018 at 17:47 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
added 7 characters in body
|
| Apr 14, 2018 at 17:40 | history | edited | Penelope Benenati | CC BY-SA 3.0 |
added 18 characters in body
|
| Apr 14, 2018 at 17:34 | history | asked | Penelope Benenati | CC BY-SA 3.0 |