Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with probability
Search options not deleted
user 9517
A mathematical puzzle whose essential nature involves randomness. Use with [mathematics]
0
votes
Clash of arrows
and subtract it from P , following this rule:
$P1 \bigcup P2 = P1+P2-P1 \bigcap P2$
so probability of the arrows to be in ollision is
$P = p_1+ ... + p_{n-1} - P_1 \bigcap .... … \bigcap P_{n-1}$
The global form of the probability for any arrow i to be hit by atleast one among n-1-i arrows coming from counter-clockwise direction is:
$U_m=
\frac{(1-U_{m-1})}{\frac{(n-2)\ …
- 1,004