WEBVTT

1
00:00:00.000 --> 00:00:08.812
Here is the problem: negative 3x plus 9y equals 21; negative 2x minus 4y equals negative 6.

2
00:00:09.262 --> 00:00:12.234
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.324 --> 00:00:33.751
Divide R1 by negative 3.

7
00:00:34.551 --> 00:00:37.326
Clear column 1 using the pivot in R1.

8
00:00:37.776 --> 00:00:40.272
Divide R2 by negative 10.

9
00:00:40.722 --> 00:00:43.497
Clear column 2 using the pivot in R2.

10
00:00:43.947 --> 00:00:45.712
Reduced row-echelon form.

11
00:00:46.512 --> 00:00:48.254
Read off the unique solution.

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

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

14
00:00:59.987 --> 00:01:05.502
Equation 1: negative 3x plus 9y equals 21, which checks out.

15
00:01:05.952 --> 00:01:12.059
Equation 2: negative 2x minus 4y equals negative 6, which checks out.