WEBVTT

1
00:00:00.000 --> 00:00:08.824
Here is the problem: negative x plus 9y equals negative 45; negative 4x plus 4y equals negative 20.

2
00:00:09.274 --> 00:00:12.211
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.150 --> 00:00:33.414
Divide R1 by negative 1.

7
00:00:34.214 --> 00:00:36.977
Clear column 1 using the pivot in R1.

8
00:00:37.427 --> 00:00:40.051
Divide R2 by negative 32.

9
00:00:40.501 --> 00:00:43.345
Clear column 2 using the pivot in R2.

10
00:00:43.795 --> 00:00:45.536
Reduced row-echelon form.

11
00:00:46.337 --> 00:00:48.055
Read off the unique solution.

12
00:00:48.855 --> 00:00:53.139
So the answer is x equals 0, y equals negative 5.

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

14
00:00:59.939 --> 00:01:05.906
Equation 1: negative x plus 9y equals negative 45, which checks out.

15
00:01:06.357 --> 00:01:12.464
Equation 2: negative 4x plus 4y equals negative 20, which checks out.