WEBVTT

1
00:00:00.000 --> 00:00:09.404
Here is the problem: negative x plus 6y equals negative 44; negative 2x plus 7y equals negative 58.

2
00:00:09.854 --> 00:00:12.954
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.892 --> 00:00:34.272
Divide R1 by negative 1.

7
00:00:35.072 --> 00:00:37.754
Clear column 1 using the pivot in R1.

8
00:00:38.204 --> 00:00:40.700
Divide R2 by negative 5.

9
00:00:41.150 --> 00:00:43.948
Clear column 2 using the pivot in R2.

10
00:00:44.398 --> 00:00:46.348
Reduced row-echelon form.

11
00:00:47.149 --> 00:00:48.890
Read off the unique solution.

12
00:00:49.691 --> 00:00:54.451
So the answer is x equals 8, y equals negative 6.

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

14
00:01:01.193 --> 00:01:07.265
Equation 1: negative x plus 6y equals negative 44, which checks out.

15
00:01:07.715 --> 00:01:14.089
Equation 2: negative 2x plus 7y equals negative 58, which checks out.