WEBVTT

1
00:00:00.000 --> 00:00:08.278
Here is the problem: negative 9x minus 2y equals negative 25; 9x plus y equals 26.

2
00:00:08.728 --> 00:00:11.688
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.837 --> 00:00:33.310
Divide R1 by negative 9.

7
00:00:34.110 --> 00:00:36.792
Clear column 1 using the pivot in R1.

8
00:00:37.242 --> 00:00:39.692
Divide R2 by negative 1.

9
00:00:40.142 --> 00:00:43.021
Clear column 2 using the pivot in R2.

10
00:00:43.471 --> 00:00:45.259
Reduced row-echelon form.

11
00:00:46.059 --> 00:00:47.789
Read off the unique solution.

12
00:00:48.589 --> 00:00:53.012
So the answer is x equals 3, y equals negative 1.

13
00:00:53.462 --> 00:00:59.081
The system has exactly one solution; substituting it back satisfies every equation.

14
00:00:59.881 --> 00:01:06.092
Equation 1: negative 9x minus 2y equals negative 25, which checks out.

15
00:01:06.542 --> 00:01:11.616
Equation 2: 9x plus y equals 26, which checks out.