Timeline for Bounding this probability in this Monte Carlo algorithm
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 6, 2021 at 23:27 | vote | accept | William4920 | ||
| Dec 4, 2021 at 22:34 | comment | added | TickaJules | Say $p=24/25$ then with $n=2$ and $x=1$, the first inequality is satisfied. But you get the probability the algorithm works at identifying the NO case is only 16/25. | |
| Dec 4, 2021 at 22:02 | comment | added | William4920 | Why do we need the two inequalities? | |
| Dec 4, 2021 at 18:27 | history | edited | TickaJules | CC BY-SA 4.0 |
added 12 characters in body
|
| Dec 4, 2021 at 17:40 | history | answered | TickaJules | CC BY-SA 4.0 |