WEBVTT

1
00:00:00.000 --> 00:00:06.246
Here is the problem: y equals 2x plus 1; y equals negative x plus 4.

2
00:00:06.696 --> 00:00:09.819
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:28.920 --> 00:00:31.184
Divide R1 by negative 2.

7
00:00:31.984 --> 00:00:34.724
Clear column 1 using the pivot in R1.

8
00:00:35.174 --> 00:00:37.798
Divide R2 by 3 over 2.

9
00:00:38.248 --> 00:00:41.046
Clear column 2 using the pivot in R2.

10
00:00:41.496 --> 00:00:43.284
Reduced row-echelon form.

11
00:00:44.084 --> 00:00:45.744
Read off the unique solution.

12
00:00:46.544 --> 00:00:50.259
So the answer is x equals 1, y equals 3.

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

14
00:00:57.024 --> 00:01:01.947
Equation 1: negative 2x plus y equals 1, which checks out.

15
00:01:02.397 --> 00:01:07.018
Equation 2: x plus y equals 4, which checks out.