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:
+ 9x + 8 = 0
Step-by-step explanation:
First, we have to simplify this quadratic equation:
(x+2)^2 + 5(x+2) - 6 = 0
x^2 + 4x + 4 + 5x + 10 - 6 = 0
x^2 + 9x + 8 = 0
Answer:
You see where ANY two intersection of the line touch the grid. Then you do the rise/run (y/x) method.
The answer is 3/4.
Because it rises 3 times and runs 4 times.
BRAINLIEST!!
