WEBVTT

1
00:00:00.000 --> 00:00:08.533
Here is the problem: negative 2x minus 3y equals negative 5; 5x minus y equals negative 30.

2
00:00:08.983 --> 00:00:11.990
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.137 --> 00:00:33.413
Divide R1 by negative 2.

7
00:00:34.213 --> 00:00:36.953
Clear column 1 using the pivot in R1.

8
00:00:37.403 --> 00:00:40.805
Divide R2 by negative 17 over 2.

9
00:00:41.255 --> 00:00:44.134
Clear column 2 using the pivot in R2.

10
00:00:44.584 --> 00:00:46.360
Reduced row-echelon form.

11
00:00:47.160 --> 00:00:48.913
Read off the unique solution.

12
00:00:49.713 --> 00:00:53.974
So the answer is x equals negative 5, y equals 5.

13
00:00:54.424 --> 00:01:00.090
The system has exactly one solution; substituting it back satisfies every equation.

14
00:01:00.890 --> 00:01:07.473
Equation 1: negative 2x minus 3y equals negative 5, which checks out.

15
00:01:07.923 --> 00:01:13.554
Equation 2: 5x minus y equals negative 30, which checks out.