WEBVTT

1
00:00:00.000 --> 00:00:07.755
Here is the problem: 6x plus 4y equals 10; 4x minus 7y equals negative 32.

2
00:00:08.205 --> 00:00:11.363
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.382 --> 00:00:32.263
Divide R1 by 6.

7
00:00:33.063 --> 00:00:35.733
Clear column 1 using the pivot in R1.

8
00:00:36.183 --> 00:00:39.945
Divide R2 by negative 29 over 3.

9
00:00:40.395 --> 00:00:43.251
Clear column 2 using the pivot in R2.

10
00:00:43.701 --> 00:00:45.605
Reduced row-echelon form.

11
00:00:46.405 --> 00:00:48.065
Read off the unique solution.

12
00:00:48.865 --> 00:00:52.940
So the answer is x equals negative 1, y equals 4.

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

14
00:00:59.670 --> 00:01:04.407
Equation 1: 6x plus 4y equals 10, which checks out.

15
00:01:04.857 --> 00:01:10.569
Equation 2: 4x minus 7y equals negative 32, which checks out.