WEBVTT

1
00:00:00.000 --> 00:00:07.651
Here is the problem: negative 6x plus 2y equals 12; x minus 7y equals 18.

2
00:00:08.101 --> 00:00:11.154
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.348 --> 00:00:32.693
Divide R1 by negative 6.

7
00:00:33.493 --> 00:00:36.210
Clear column 1 using the pivot in R1.

8
00:00:36.660 --> 00:00:39.806
Divide R2 by negative 20 over 3.

9
00:00:40.256 --> 00:00:43.089
Clear column 2 using the pivot in R2.

10
00:00:43.539 --> 00:00:45.466
Reduced row-echelon form.

11
00:00:46.266 --> 00:00:47.996
Read off the unique solution.

12
00:00:48.796 --> 00:00:53.405
So the answer is x equals negative 3, y equals negative 3.

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

14
00:01:00.297 --> 00:01:05.405
Equation 1: negative 6x plus 2y equals 12, which checks out.

15
00:01:05.855 --> 00:01:11.184
Equation 2: x minus 7y equals 18, which checks out.