WEBVTT

1
00:00:00.000 --> 00:00:08.464
Here is the problem: x minus 5y equals negative 2; negative 4x minus 2y equals negative 14.

2
00:00:08.914 --> 00:00:12.037
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.033 --> 00:00:33.796
Clear column 1 using the pivot in R1.

7
00:00:34.596 --> 00:00:37.324
Divide R2 by negative 22.

8
00:00:37.774 --> 00:00:40.630
Clear column 2 using the pivot in R2.

9
00:00:41.080 --> 00:00:43.007
Reduced row-echelon form.

10
00:00:43.457 --> 00:00:45.291
Read off the unique solution.

11
00:00:46.091 --> 00:00:49.946
So the answer is x equals 3, y equals 1.

12
00:00:50.395 --> 00:00:55.770
The system has exactly one solution; substituting it back satisfies every equation.

13
00:00:56.570 --> 00:01:02.212
Equation 1: x minus 5y equals negative 2, which checks out.

14
00:01:02.662 --> 00:01:08.838
Equation 2: negative 4x minus 2y equals negative 14, which checks out.