WEBVTT

1
00:00:00.000 --> 00:00:07.628
Here is the problem: negative 2x minus 8y equals 56; x minus 9y equals 50.

2
00:00:08.078 --> 00:00:11.155
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.232 --> 00:00:32.438
Divide R1 by negative 2.

7
00:00:33.238 --> 00:00:35.943
Clear column 1 using the pivot in R1.

8
00:00:36.393 --> 00:00:39.110
Divide R2 by negative 13.

9
00:00:39.560 --> 00:00:42.381
Clear column 2 using the pivot in R2.

10
00:00:42.831 --> 00:00:44.700
Reduced row-echelon form.

11
00:00:45.500 --> 00:00:47.183
Read off the unique solution.

12
00:00:47.983 --> 00:00:52.557
So the answer is x equals negative 4, y equals negative 6.

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

14
00:00:59.252 --> 00:01:05.092
Equation 1: negative 2x minus 8y equals 56, which checks out.

15
00:01:05.542 --> 00:01:10.372
Equation 2: x minus 9y equals 50, which checks out.