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:
<
Step-by-step explanation:
-7.56 < -5.76
Answer:
B
Step-by-step explanation:
The chances of the first student walking to school is 7/30.
Without replacement, there are 29 students left. Hence the chance of the second student walking to school is 6/29 of the original 7/30 chance.

The fourth table is the correct answer
<span>the coordinates of vertex A = (1,1)
</span><span>the coordinates of vertex B = (2,3)
</span><span>the coordinates of vertex C = (2,1)
</span>