WEBVTT

1
00:00:00.000 --> 00:00:09.416
Here is the problem: negative 7x plus 8y equals negative 11; negative 8x plus 4y equals negative 28.

2
00:00:09.866 --> 00:00:12.908
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:32.055 --> 00:00:34.412
Divide R1 by negative 7.

7
00:00:35.212 --> 00:00:38.010
Clear column 1 using the pivot in R1.

8
00:00:38.460 --> 00:00:41.966
Divide R2 by negative 36 over 7.

9
00:00:42.416 --> 00:00:45.249
Clear column 2 using the pivot in R2.

10
00:00:45.699 --> 00:00:47.545
Reduced row-echelon form.

11
00:00:48.345 --> 00:00:50.098
Read off the unique solution.

12
00:00:50.898 --> 00:00:54.892
So the answer is x equals 5, y equals 3.

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

14
00:01:01.761 --> 00:01:07.647
Equation 1: negative 7x plus 8y equals negative 11, which checks out.

15
00:01:08.097 --> 00:01:14.970
Equation 2: negative 8x plus 4y equals negative 28, which checks out.