WEBVTT

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

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

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

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

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

6
00:00:39.509 --> 00:00:41.819
Divide R1 by negative 3.

7
00:00:42.619 --> 00:00:45.289
Clear column 1 using the pivot in R1.

8
00:00:45.739 --> 00:00:47.399
Divide R2 by 2.

9
00:00:47.849 --> 00:00:50.624
Clear column 2 using the pivot in R2.

10
00:00:51.074 --> 00:00:53.129
Divide R3 by 4.

11
00:00:53.929 --> 00:00:57.098
Clear column 3 using the pivot in R3.

12
00:00:57.549 --> 00:00:59.441
Reduced row-echelon form.

13
00:00:59.891 --> 00:01:01.679
Read off the unique solution.

14
00:01:02.479 --> 00:01:08.621
So the answer is x equals 4, y equals negative 4, z equals negative 3.

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

16
00:01:15.479 --> 00:01:22.689
Equation 1: negative 3x minus 3y minus 3z equals 9, which checks out.

17
00:01:23.139 --> 00:01:29.803
Equation 2: negative 3x minus y minus 3z equals 1, which checks out.

18
00:01:30.253 --> 00:01:37.950
Equation 3: negative x plus 3y plus 3z equals negative 25, which checks out.