WEBVTT

1
00:00:00.000 --> 00:00:08.557
Here is the problem: negative 4x minus 4y equals negative 36; 5x plus 4y equals 41.

2
00:00:09.007 --> 00:00:12.165
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.394 --> 00:00:33.855
Divide R1 by negative 4.

7
00:00:34.655 --> 00:00:37.453
Clear column 1 using the pivot in R1.

8
00:00:37.903 --> 00:00:40.213
Divide R2 by negative 1.

9
00:00:40.663 --> 00:00:43.542
Clear column 2 using the pivot in R2.

10
00:00:43.992 --> 00:00:45.826
Reduced row-echelon form.

11
00:00:46.626 --> 00:00:48.367
Read off the unique solution.

12
00:00:49.168 --> 00:00:53.057
So the answer is x equals 5, y equals 4.

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

14
00:00:59.903 --> 00:01:06.103
Equation 1: negative 4x minus 4y equals negative 36, which checks out.

15
00:01:06.553 --> 00:01:12.091
Equation 2: 5x plus 4y equals 41, which checks out.