WEBVTT

1
00:00:00.000 --> 00:00:08.394
Here is the problem: negative 9x minus 9y equals 63; 4x minus 4y equals 4.

2
00:00:08.844 --> 00:00:11.909
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.044 --> 00:00:33.459
Divide R1 by negative 9.

7
00:00:34.259 --> 00:00:36.906
Clear column 1 using the pivot in R1.

8
00:00:37.356 --> 00:00:39.713
Divide R2 by negative 8.

9
00:00:40.163 --> 00:00:43.077
Clear column 2 using the pivot in R2.

10
00:00:43.527 --> 00:00:45.361
Reduced row-echelon form.

11
00:00:46.161 --> 00:00:47.891
Read off the unique solution.

12
00:00:48.691 --> 00:00:53.579
So the answer is x equals negative 3, y equals negative 4.

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

14
00:01:00.402 --> 00:01:06.416
Equation 1: negative 9x minus 9y equals 63, which checks out.

15
00:01:06.866 --> 00:01:12.137
Equation 2: 4x minus 4y equals 4, which checks out.