WEBVTT

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

2
00:00:09.030 --> 00:00:12.002
2 linear equations in 2 unknowns (x, y).

3
00:00:12.802 --> 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.829
Build the augmented matrix [A | b]. Columns: x, y | constant.

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

6
00:00:31.219 --> 00:00:32.914
Divide R1 by 2.

7
00:00:33.714 --> 00:00:36.466
Clear column 1 using the pivot in R1.

8
00:00:36.916 --> 00:00:39.702
Divide R2 by negative 19.

9
00:00:40.152 --> 00:00:42.985
Clear column 2 using the pivot in R2.

10
00:00:43.435 --> 00:00:45.223
Reduced row-echelon form.

11
00:00:46.023 --> 00:00:47.741
Read off the unique solution.

12
00:00:48.541 --> 00:00:52.291
So the answer is x equals 2, y equals 2.

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

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

15
00:01:04.893 --> 00:01:10.675
Equation 2: negative 8x plus y equals negative 14, which checks out.