WEBVTT

1
00:00:00.000 --> 00:00:08.139
Here is the problem: negative 6x minus 5y equals 5; 2x plus 2y equals negative 4.

2
00:00:08.589 --> 00:00:11.689
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.778 --> 00:00:33.193
Divide R1 by negative 6.

7
00:00:33.993 --> 00:00:36.652
Clear column 1 using the pivot in R1.

8
00:00:37.102 --> 00:00:39.494
Divide R2 by 1 over 3.

9
00:00:39.944 --> 00:00:42.788
Clear column 2 using the pivot in R2.

10
00:00:43.238 --> 00:00:44.991
Reduced row-echelon form.

11
00:00:45.791 --> 00:00:47.532
Read off the unique solution.

12
00:00:48.333 --> 00:00:52.791
So the answer is x equals 5, y equals negative 7.

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

14
00:00:59.625 --> 00:01:05.534
Equation 1: negative 6x minus 5y equals 5, which checks out.

15
00:01:05.985 --> 00:01:11.384
Equation 2: 2x plus 2y equals negative 4, which checks out.