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
If we join the points we are gonna end up with a triangle, from there by finding the centroid of the triangle we will get a point which is equidistant from all the three points given in the diagram.
Formula for Centroid:
Answer:
Slide 1:
1. Solution = (-3,2)
<em>y = 2x - 1</em>
<em>y = 3/2x + 6</em>
2. No solution
<em>y = -4/2x + 4</em>
<em>y = -4/2x - 5</em>
Slide 2:
3. Solution = (1, -6) ONE SOLUTION
4. Solution = (-4, -1) ONE SOLUTION
p.s i attached the graphs for problems 3 and 4. The first picture is for problem 3 and the second picture is for problem 4
I really hope this helped :)
To find the sum of the interior angles of a nonagon, divide it up into triangles... There are seven triangles... Because the sum of the angles of each triangle is 180 degrees... We get
7 * 180 = 1260°
So, the sum of the interior angles of a nonagon is 1260 degrees.
