Use the Pythagorean Theorem to find the distance of the missing side. (I’m sorry I need help with the whole thing)
1 answer:
You might be interested in
Answer:
Your final answer is $528.92
Step-by-step explanation:
Answer:
if repetition is allowed,
if repetition is not allowed.
Step-by-step explanation:
For the first case, we have a choice of 26 letters <em>each step of the way. </em>For each of the 26 letters we can pick for the first slot, we can pick 26 for the second, and for each of <em>those</em> 26, we can pick between 26 again for our third slot, and well, you get the idea. Each step, we're multiplying the number of possible passwords by 26, so for a four-letter password, that comes out to 26 × 26 × 26 × 26 = possible passwords.
If repetition is <em>not </em>allowed, we're slowly going to deplete our supply of letters. We still get 26 to choose from for the first letter, but once we've picked it, we only have 25 for the second. Once we pick the second, we only have 24 for the third, and so on for the fourth. This gives us instead a pretty generous choice of 26 × 25 × 24 × 23 passwords.
Answer:
Probability that detector B goes off is '0.615'
Step-by-step explanation:
Given that:
1) Probability that detector A goes off and detector B does not go off is 0.25.
2)Probability that detector A does not go off is 0.35.
3)Probability that detector A goes off is (1-0.35)=0.65
Assuming that
Probability that detector B goes off is 'p' Hence the probability that detector B does not goes off is (1-p)
Thus the probability that detector A goes off and detector B does not go off is product of the individual probabilities
Probability that detector B goes off is '0.615'