The answer would be A. When using Cramer's Rule to solve a system of equations, if the determinant of the coefficient matrix equals zero and neither numerator determinant is zero, then the system has infinite solutions. It would be hard finding this answer when we use the Cramer's Rule so instead we use the Gauss Elimination. Considering the equations:
x + y = 3 and <span>2x + 2y = 6
Determinant of the equations are </span>
<span>| 1 1 | </span>
<span>| 2 2 | = 0
</span>
the numerator determinants would be
<span>| 3 1 | . .| 1 3 | </span>
<span>| 6 2 | = | 2 6 | = 0.
Executing Gauss Elimination, any two numbers, whose sum is 3, would satisfy the given system. F</span>or instance (3, 0), <span>(2, 1) and (4, -1). Therefore, it would have infinitely many solutions. </span>
Answer: triangle 1, triangle 2, and triangle 3
Step-by-step explanation:
Triangles 1 and 3 are congruent by SAS. So, by CPCTC, all three sides are congruent, making triangle 2 congruent to them as well by SSS.
368,743 /368,753 /459,156/530,076/796,154 from smallest to biggest
Answer:
use calculater please it will not take long
