WEBVTT

1
00:00:00.000 --> 00:00:07.500
Here is the problem: negative x plus 6y equals 14; 9x plus 8y equals 60.

2
00:00:07.950 --> 00:00:10.957
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:29.756 --> 00:00:32.113
Divide R1 by negative 1.

7
00:00:32.913 --> 00:00:35.583
Clear column 1 using the pivot in R1.

8
00:00:36.033 --> 00:00:38.088
Divide R2 by 62.

9
00:00:38.538 --> 00:00:41.348
Clear column 2 using the pivot in R2.

10
00:00:41.798 --> 00:00:43.690
Reduced row-echelon form.

11
00:00:44.490 --> 00:00:46.255
Read off the unique solution.

12
00:00:47.055 --> 00:00:50.724
So the answer is x equals 4, y equals 3.

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

14
00:00:57.512 --> 00:01:03.050
Equation 1: negative x plus 6y equals 14, which checks out.

15
00:01:03.500 --> 00:01:08.771
Equation 2: 9x plus 8y equals 60, which checks out.