WEBVTT

1
00:00:00.000 --> 00:00:07.906
Here is the problem: 2x minus y equals negative 11; 8x plus 8y equals negative 32.

2
00:00:08.356 --> 00:00:11.224
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.627 --> 00:00:32.369
Divide R1 by 2.

7
00:00:33.169 --> 00:00:35.897
Clear column 1 using the pivot in R1.

8
00:00:36.347 --> 00:00:38.065
Divide R2 by 12.

9
00:00:38.515 --> 00:00:41.359
Clear column 2 using the pivot in R2.

10
00:00:41.809 --> 00:00:43.550
Reduced row-echelon form.

11
00:00:44.351 --> 00:00:46.000
Read off the unique solution.

12
00:00:46.800 --> 00:00:51.084
So the answer is x equals negative 5, y equals 1.

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

14
00:00:58.000 --> 00:01:03.584
Equation 1: 2x minus y equals negative 11, which checks out.

15
00:01:04.034 --> 00:01:10.129
Equation 2: 8x plus 8y equals negative 32, which checks out.