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:
C
Step-by-step explanation:
first look at all the numbers in the relation.then since inverse means opposite find the answers where the numbers in the parenthesis are in the opposite order than the question. Finally look for the answer In which all the positive numbers in the parenthesis(in the given relation) are negative (on the answers)and the negative numbers (in the given relation) are positive (on the answers).
Answer:
x = -2
Step-by-step explanation:
Solve -6x = 5x + 22
add 6x to both sides
0 = 6x + 5x + 22
0 = 11x + 22
11x = -22
x = -22/11
x = -2
5 rows of 14 chairs
7 rows of 10 chairs
Or
14 rows of 5 chairs
10 rows of 7 chairs
Answer:
imagine
Step-by-step explanation:
