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:
3339/2=1669.5
Step-by-step explanation:
Answer:
c.9
the correct answer
semoga jawapan ini membantu
Do you mean a_(n+1), worded a sub (n+1)?
If so yes. If the function of the sequence is getting smaller or more negative with each term.
The answer is C. I got this by doing a^2 + b^2= c^2. 50^2 + 16^2=c^2, 2500 + 256 = c^2, 2756 = c^2, then you take the square root of 2756 and that gives you your answer 52.50 yards. Hope this helps :D
