WEBVTT

1
00:00:00.000 --> 00:00:09.265
Here is the problem: negative 5x minus 6y equals 26; negative 3x minus 5y equals 17.

2
00:00:09.715 --> 00:00:12.815
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:32.031 --> 00:00:34.423
Divide R1 by negative 5.

7
00:00:35.223 --> 00:00:37.870
Clear column 1 using the pivot in R1.

8
00:00:38.320 --> 00:00:41.536
Divide R2 by negative 7 over 5.

9
00:00:41.986 --> 00:00:44.830
Clear column 2 using the pivot in R2.

10
00:00:45.280 --> 00:00:47.126
Reduced row-echelon form.

11
00:00:47.926 --> 00:00:49.656
Read off the unique solution.

12
00:00:50.456 --> 00:00:54.972
So the answer is x equals negative 4, y equals negative 1.

13
00:00:55.422 --> 00:01:00.960
The system has exactly one solution; substituting it back satisfies every equation.

14
00:01:01.760 --> 00:01:08.006
Equation 1: negative 5x minus 6y equals 26, which checks out.

15
00:01:08.456 --> 00:01:14.807
Equation 2: negative 3x minus 5y equals 17, which checks out.