For c to be positive, and for b to be negative, m must be negative and n must be negative.
X^2 - bx + c = (x - m)(x - n).
c is the product of m and n. If both m and n are positive, c would be positive. However b is the sum of m and n, therefore to make b negative, both m and n must be negative to ensure that the product of m and n is positive
The converse of the hinge theorem is also true: If the two sides of one triangle are congruent<span> to two sides of another triangle, and the third side of the first triangle is greater than the third side of the second triangle, then the included angle of the first triangle is larger than the included angle of the second .</span>
Answer:
9 teams
Step-by-step explanation:
If the total games played was 36 and no team played each other twice, we need to ensure there isn't any double counting.
36 = (n-1) + (n-2) + (n-3) ... + (n-(n-1))
using this knowledge, we can then count up:
1+2+3+4+5+6+7+8 = 36
If our highest number is 8, then we know there must be 9 teams, because no team can play themselves.
