Timeline for Batched coupon collector with quota
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 11, 2016 at 13:41 | history | edited | N. Gast | CC BY-SA 3.0 |
added 713 characters in body
|
| Apr 7, 2016 at 18:55 | comment | added | N. Gast | I have a proof that $k=2$ requires less coupon than $k=1$. This proof is based on using a recurrence equation (on $m$) for $\mathbb{E}[T_{k,\vec{m}}]$. | |
| Apr 7, 2016 at 18:29 | comment | added | Douglas Zare | You say that you don't have a reasonably small proof. Do you have a long proof? | |
| Apr 7, 2016 at 15:56 | review | First posts | |||
| Apr 7, 2016 at 16:01 | |||||
| Apr 7, 2016 at 15:52 | history | asked | N. Gast | CC BY-SA 3.0 |