The probability that all of them will be defective is 0.0000759375
<em><u>Explanation</u></em>
The general <u>Binomial Probability</u> formula is....
, where p is the probability of success, n is the total number of trials and r is the desired numbers of trials.
Given, the probability that a computer will be defective is 0.15 , so p = 0.15
Five computers are manufactured and we need to find the probability that all of them will be defective. That means, n = 5 and r = 5
Now according to the above formula....
So, the probability that all of them will be defective is 0.0000759375
Answer:
5 7/12
Step-by-step explanation:
have a great day :)
I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression
f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k
If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is.
If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.
So here's the function
int product(int m, int k)
{
if (m == 0) return 0;
return product(m-1,k) + k;
}
