WEBVTT

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

2
00:00:09.274 --> 00:00:12.142
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.092 --> 00:00:33.460
Divide R1 by negative 5.

7
00:00:34.260 --> 00:00:37.012
Clear column 1 using the pivot in R1.

8
00:00:37.462 --> 00:00:39.308
Divide R2 by 16.

9
00:00:39.758 --> 00:00:42.637
Clear column 2 using the pivot in R2.

10
00:00:43.087 --> 00:00:44.921
Reduced row-echelon form.

11
00:00:45.721 --> 00:00:47.393
Read off the unique solution.

12
00:00:48.193 --> 00:00:52.744
So the answer is x equals negative 2, y equals negative 3.

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

14
00:00:59.439 --> 00:01:05.650
Equation 1: negative 5x minus 5y equals 25, which checks out.

15
00:01:06.100 --> 00:01:12.009
Equation 2: negative 9x plus 7y equals negative 3, which checks out.