WEBVTT

1
00:00:00.000 --> 00:00:08.777
Here is the problem: negative 6x minus 8y equals negative 48; negative 5x plus y equals 6.

2
00:00:09.227 --> 00:00:12.315
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.520 --> 00:00:33.865
Divide R1 by negative 6.

7
00:00:34.665 --> 00:00:37.358
Clear column 1 using the pivot in R1.

8
00:00:37.808 --> 00:00:40.896
Divide R2 by 23 over 3.

9
00:00:41.346 --> 00:00:44.086
Clear column 2 using the pivot in R2.

10
00:00:44.536 --> 00:00:46.463
Reduced row-echelon form.

11
00:00:47.263 --> 00:00:49.028
Read off the unique solution.

12
00:00:49.828 --> 00:00:53.915
So the answer is x equals 0, y equals 6.

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

14
00:01:00.761 --> 00:01:07.472
Equation 1: negative 6x minus 8y equals negative 48, which checks out.

15
00:01:07.922 --> 00:01:13.251
Equation 2: negative 5x plus y equals 6, which checks out.