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:
15
Step-by-step explanation:
Simplify the following:
8×9 - 6×7 - 15
8×9 = 72:
72 - 6×7 - 15
-6×7 = -42:
72 + -42 - 15
72 - 42 - 15 = 72 - (42 + 15):
72 - (42 + 15)
| 4 | 2
+ | 1 | 5
| 5 | 7:
72 - 57
| 6 | 12
| 7 | 2
- | 5 | 7
| 1 | 5:
Answer: 15
72,491 + 19,326 = 91,817
Leah scored 91,817 points
The main formula for a polynomial ax^my^n+...
the degree is the sum of the highest degree of the polynomial, it is m+n
<span>the degree of x^3y^2+7x^2y^5-3xy^8 is 9, because </span><span>3xy^8 is the term where we can find a highest value of power (8)
so the degree is degree of x, it is 1 + degree of y (it is 8)
</span>
