WEBVTT

1
00:00:00.000 --> 00:00:09.009
Here is the problem: negative 9x minus 8y equals negative 22; negative 5x plus 5y equals negative 50.

2
00:00:09.459 --> 00:00:12.466
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.695 --> 00:00:34.121
Divide R1 by negative 9.

7
00:00:34.922 --> 00:00:37.627
Clear column 1 using the pivot in R1.

8
00:00:38.077 --> 00:00:40.875
Divide R2 by 85 over 9.

9
00:00:41.325 --> 00:00:44.204
Clear column 2 using the pivot in R2.

10
00:00:44.654 --> 00:00:46.558
Reduced row-echelon form.

11
00:00:47.358 --> 00:00:49.111
Read off the unique solution.

12
00:00:49.911 --> 00:00:54.392
So the answer is x equals 6, y equals negative 4.

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

14
00:01:01.087 --> 00:01:07.322
Equation 1: negative 9x minus 8y equals negative 22, which checks out.

15
00:01:07.772 --> 00:01:13.786
Equation 2: negative 5x plus 5y equals negative 50, which checks out.