WEBVTT

1
00:00:00.000 --> 00:00:12.260
Here is the problem: negative 2x plus y plus z equals negative 1; 3x minus y plus 2z equals 9; 3y plus 3z equals 9.

2
00:00:12.710 --> 00:00:16.483
3 linear equations in 3 unknowns (x, y, z).

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

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

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

6
00:00:36.316 --> 00:00:38.603
Divide R1 by negative 2.

7
00:00:39.403 --> 00:00:42.201
Clear column 1 using the pivot in R1.

8
00:00:42.651 --> 00:00:44.938
Divide R2 by 1 over 2.

9
00:00:45.388 --> 00:00:48.244
Clear column 2 using the pivot in R2.

10
00:00:48.694 --> 00:00:51.457
Divide R3 by negative 18.

11
00:00:52.257 --> 00:00:55.496
Clear column 3 using the pivot in R3.

12
00:00:55.946 --> 00:00:57.897
Reduced row-echelon form.

13
00:00:58.347 --> 00:01:00.100
Read off the unique solution.

14
00:01:00.900 --> 00:01:06.020
So the answer is x equals 2, y equals 1, z equals 2.

15
00:01:06.470 --> 00:01:12.136
The system has exactly one solution; substituting it back satisfies every equation.

16
00:01:12.936 --> 00:01:18.555
Equation 1: negative 2x plus y plus z equals negative 1, which checks out.

17
00:01:19.005 --> 00:01:24.984
Equation 2: 3x minus y plus 2z equals 9, which checks out.

18
00:01:25.434 --> 00:01:30.473
Equation 3: 3y plus 3z equals 9, which checks out.