Timeline for Realisation of at least one event among N events
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 30, 2018 at 15:29 | comment | added | whuber♦ | You're right: I misread the formula because it is broken at a strange place across two lines. But, once again, I would like to suggest that if you would attempt an explanation of your formula you would be able to see for yourself whether it is correct or not. You might also be able to see that it is algebraically equivalent to the author's solution by using the fact that the limiting value of $p_r$ is indeed $1.$ | |
| Sep 30, 2018 at 15:23 | comment | added | Win_odd Dhamnekar | @whuber $p_r$will reach 1 when r becomes larger and larger.Recall formula for union of two events and use it for N events. | |
| Sep 30, 2018 at 15:08 | comment | added | whuber♦ | You seem to be fishing for a solution, because you haven't offered any reasons for the various formulas you have supplied. In the current case the same considerations as before will tell you whether it makes sense; namely, what happens to your $p_r$ as $r$ grows large? | |
| Sep 30, 2018 at 14:34 | history | edited | Win_odd Dhamnekar | CC BY-SA 4.0 |
Corrected my wrong answer
|
| Sep 30, 2018 at 3:21 | history | edited | Win_odd Dhamnekar | CC BY-SA 4.0 |
added 4 characters in body
|
| Sep 30, 2018 at 2:16 | history | edited | Win_odd Dhamnekar | CC BY-SA 4.0 |
answer added
|
| Sep 29, 2018 at 18:09 | comment | added | whuber♦ | This is a coupon collector problem. The "coupons" are the ordered pairs of values. The twist here is that you don't want to collect all of them: you just want to collect six particular ones out of the 36. The basis of your answer is unclear because, as in your other questions, you haven't attempted to justify it. That it is incorrect is apparent by considering what happens as $r$ grows large: it decreases exponentially rather than approaching $1.$ | |
| Sep 29, 2018 at 17:22 | history | asked | Win_odd Dhamnekar | CC BY-SA 4.0 |