WEBVTT

1
00:00:00.000 --> 00:00:08.975
Here is the problem: negative 3x minus 6y equals 15; negative 5x minus 1y equals 16.

2
00:00:09.425 --> 00:00:12.478
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.591 --> 00:00:33.971
Divide R1 by negative 3.

7
00:00:34.771 --> 00:00:37.488
Clear column 1 using the pivot in R1.

8
00:00:37.938 --> 00:00:39.807
Divide R2 by 9.

9
00:00:40.257 --> 00:00:43.113
Clear column 2 using the pivot in R2.

10
00:00:43.563 --> 00:00:45.467
Reduced row-echelon form.

11
00:00:46.267 --> 00:00:47.950
Read off the unique solution.

12
00:00:48.750 --> 00:00:53.464
So the answer is x equals negative 3, y equals negative 1.

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

14
00:01:00.380 --> 00:01:06.440
Equation 1: negative 3x minus 6y equals 15, which checks out.

15
00:01:06.890 --> 00:01:12.683
Equation 2: negative 5x minus y equals 16, which checks out.