WEBVTT

1
00:00:00.000 --> 00:00:08.951
Here is the problem: negative 2x plus y equals negative 13; negative 6x minus 8y equals negative 28.

2
00:00:09.401 --> 00:00:12.466
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.718 --> 00:00:33.959
Divide R1 by negative 2.

7
00:00:34.759 --> 00:00:37.464
Clear column 1 using the pivot in R1.

8
00:00:37.914 --> 00:00:40.317
Divide R2 by negative 11.

9
00:00:40.767 --> 00:00:43.553
Clear column 2 using the pivot in R2.

10
00:00:44.003 --> 00:00:45.872
Reduced row-echelon form.

11
00:00:46.672 --> 00:00:48.390
Read off the unique solution.

12
00:00:49.190 --> 00:00:53.579
So the answer is x equals 6, y equals negative 1.

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

14
00:01:00.379 --> 00:01:06.149
Equation 1: negative 2x plus y equals negative 13, which checks out.

15
00:01:06.599 --> 00:01:13.124
Equation 2: negative 6x minus 8y equals negative 28, which checks out.