WEBVTT

1
00:00:00.000 --> 00:00:08.266
Here is the problem: 3x minus 4y equals negative 2; 2x minus 6y equals negative 18.

2
00:00:08.716 --> 00:00:11.862
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.812 --> 00:00:32.658
Divide R1 by 3.

7
00:00:33.458 --> 00:00:36.279
Clear column 1 using the pivot in R1.

8
00:00:36.729 --> 00:00:40.015
Divide R2 by negative 10 over 3.

9
00:00:40.465 --> 00:00:43.205
Clear column 2 using the pivot in R2.

10
00:00:43.655 --> 00:00:45.536
Reduced row-echelon form.

11
00:00:46.336 --> 00:00:48.182
Read off the unique solution.

12
00:00:48.982 --> 00:00:52.953
So the answer is x equals 6, y equals 5.

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

14
00:00:59.578 --> 00:01:05.278
Equation 1: 3x minus 4y equals negative 2, which checks out.

15
00:01:05.729 --> 00:01:11.569
Equation 2: 2x minus 6y equals negative 18, which checks out.