Answer:
1716 ways
Step-by-step explanation:
Given that :
Number of entrants = 13
The number of ways of attaining first, second and third position :
The number of ways of attaining first ; only 1 person can be first ;
Using permutation :
nPr = n! ÷(n-r)!
13P1 = 13! ÷ 12! = 13
Second position :
We have 12 entrants left :
nPr = n! ÷(n-r)!
12P1 = 12! ÷ 11! = 12
Third position :
We have 11 entrants left :
nPr = n! ÷(n-r)!
11P1 = 11! ÷ 10! = 11
Hence, Number of ways = (13 * 12 * 11) = 1716 ways
Answer:
A Rhombus is basically a square turned diagonally my dude
Step-by-step explanation:
Answer:
solution for n is 
Step-by-step explanation:
Given an equation containing one variable n.
The equation is as follows:
To solve for n we can subtract 3/4 from both the sides
The result is
Verify:
Substitute the answer in the given equation.
Both sides equal thus proving our correctness of answer.
Answer:
c
Step-by-step explanation:
because u cant be wrong with going with none of the above due the fact that they could be decimals and they didn't want to write out the full number therefore making it incorrect. No need to thank me.
Answer:
0.61596
Step-by-step explanation:
Given that:
λ = 5 (5 errors per page)
Poisson distribution formula :
P(x = x) = (λ^x * e^-λ) / x!
Probability that page does not need to be retyped means that error on page is less than or equal to 5
P(x ≤ 5) = p(x = 5) + p(x = 4) +... + p(x = 0)
The individual probabilities can be obtained using the formula above or the use of a calculator
P(x ≤ 5) = 0.17547 + 0.17547 + 0.14037 + 0.08422 + 0.03369 + 0.00674
P(x ≤ 5) = 0.61596
