WEBVTT

1
00:00:00.000 --> 00:00:08.150
Here is the problem: negative x plus 3y equals 11; negative 4x plus 7y equals 19.

2
00:00:08.600 --> 00:00:11.537
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.718 --> 00:00:33.098
Divide R1 by negative 1.

7
00:00:33.898 --> 00:00:36.603
Clear column 1 using the pivot in R1.

8
00:00:37.053 --> 00:00:39.468
Divide R2 by negative 5.

9
00:00:39.918 --> 00:00:42.832
Clear column 2 using the pivot in R2.

10
00:00:43.282 --> 00:00:45.151
Reduced row-echelon form.

11
00:00:45.951 --> 00:00:47.681
Read off the unique solution.

12
00:00:48.481 --> 00:00:52.219
So the answer is x equals 4, y equals 5.

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

14
00:00:58.868 --> 00:01:04.429
Equation 1: negative x plus 3y equals 11, which checks out.

15
00:01:04.879 --> 00:01:10.545
Equation 2: negative 4x plus 7y equals 19, which checks out.