WEBVTT

1
00:00:00.000 --> 00:00:08.046
Here is the problem: negative 7x plus 2y equals 16; negative 2x minus y equals 3.

2
00:00:08.496 --> 00:00:11.410
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.720 --> 00:00:33.019
Divide R1 by negative 7.

7
00:00:33.819 --> 00:00:36.536
Clear column 1 using the pivot in R1.

8
00:00:36.986 --> 00:00:40.086
Divide R2 by negative 11 over 7.

9
00:00:40.536 --> 00:00:43.334
Clear column 2 using the pivot in R2.

10
00:00:43.784 --> 00:00:45.665
Reduced row-echelon form.

11
00:00:46.465 --> 00:00:48.241
Read off the unique solution.

12
00:00:49.041 --> 00:00:53.255
So the answer is x equals negative 2, y equals 1.

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

14
00:01:00.147 --> 00:01:05.894
Equation 1: negative 7x plus 2y equals 16, which checks out.

15
00:01:06.344 --> 00:01:11.870
Equation 2: negative 2x minus y equals 3, which checks out.