WEBVTT

1
00:00:00.000 --> 00:00:08.150
Here is the problem: x minus 2y equals negative 14; x minus 5y equals negative 26.

2
00:00:08.600 --> 00:00:11.758
2 linear equations in 2 unknowns (x, y).

3
00:00:12.558 --> 00:00:18.769
Write every equation in standard form. Move all variable terms to the left and constants to the right.

4
00:00:19.219 --> 00:00:23.399
Build the augmented matrix [A | b]. Columns: x, y | constant.

5
00:00:23.849 --> 00:00:30.502
Gauss–Jordan elimination. Use row operations to make each pivot 1 and clear the rest of its column.

6
00:00:30.952 --> 00:00:33.611
Clear column 1 using the pivot in R1.

7
00:00:34.411 --> 00:00:37.128
Divide R2 by negative 3.

8
00:00:37.578 --> 00:00:40.434
Clear column 2 using the pivot in R2.

9
00:00:40.884 --> 00:00:42.823
Reduced row-echelon form.

10
00:00:43.273 --> 00:00:44.956
Read off the unique solution.

11
00:00:45.756 --> 00:00:50.319
So the answer is x equals negative 6, y equals 4.

12
00:00:50.769 --> 00:00:56.237
The system has exactly one solution; substituting it back satisfies every equation.

13
00:00:57.037 --> 00:01:02.529
Equation 1: x minus 2y equals negative 14, which checks out.

14
00:01:02.979 --> 00:01:08.552
Equation 2: x minus 5y equals negative 26, which checks out.