WEBVTT

1
00:00:00.000 --> 00:00:08.812
Here is the problem: negative 3x minus 9y equals 9; 2x minus 7y equals 33.

2
00:00:09.262 --> 00:00:12.292
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.532 --> 00:00:34.017
Divide R1 by negative 3.

7
00:00:34.817 --> 00:00:37.441
Clear column 1 using the pivot in R1.

8
00:00:37.891 --> 00:00:40.666
Divide R2 by negative 13.

9
00:00:41.116 --> 00:00:43.891
Clear column 2 using the pivot in R2.

10
00:00:44.341 --> 00:00:46.129
Reduced row-echelon form.

11
00:00:46.929 --> 00:00:48.601
Read off the unique solution.

12
00:00:49.401 --> 00:00:53.743
So the answer is x equals 6, y equals negative 3.

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

14
00:01:00.705 --> 00:01:06.429
Equation 1: negative 3x minus 9y equals 9, which checks out.

15
00:01:06.879 --> 00:01:12.847
Equation 2: 2x minus 7y equals 33, which checks out.