Timeline for What is the probability that throwing $m$ balls at random in $n$ urns at least one urn contains $c$ elements?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 19, 2018 at 20:04 | comment | added | seba | It's trivial that it does not work—just try $n=c=2$, $m=4$. | |
| Feb 19, 2018 at 16:14 | comment | added | Arthur | The cases where more than one bin is overflowed is overcounted in this method (at least if you were thinking of taking the probability of $x_1\geq c$ and multiply by $n$). | |
| Feb 19, 2018 at 16:05 | comment | added | Mostafa Ayaz | since $x_1-c=y_1\ge 0$ so it contains both cases | |
| Feb 19, 2018 at 16:04 | comment | added | Mostafa Ayaz | Of course it does since there is no constraint on the rest of the $x_i$'s | |
| Feb 19, 2018 at 16:03 | history | edited | Mostafa Ayaz | CC BY-SA 3.0 |
deleted 53 characters in body
|
| Feb 19, 2018 at 16:03 | comment | added | Ross Millikan | This does not reflect the times one bin gets more than $c$ nor the times more than one bin gets $c$. | |
| Feb 19, 2018 at 16:01 | history | answered | Mostafa Ayaz | CC BY-SA 3.0 |