WEBVTT

1
00:00:00.000 --> 00:00:08.023
Here is the problem: 3x minus 8y equals negative 50; 5x plus 2y equals 24.

2
00:00:08.473 --> 00:00:11.585
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.756 --> 00:00:32.637
Divide R1 by 3.

7
00:00:33.437 --> 00:00:36.212
Clear column 1 using the pivot in R1.

8
00:00:36.662 --> 00:00:39.750
Divide R2 by 46 over 3.

9
00:00:40.200 --> 00:00:42.986
Clear column 2 using the pivot in R2.

10
00:00:43.436 --> 00:00:45.363
Reduced row-echelon form.

11
00:00:46.163 --> 00:00:47.870
Read off the unique solution.

12
00:00:48.670 --> 00:00:52.652
So the answer is x equals 2, y equals 7.

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

14
00:00:59.405 --> 00:01:05.233
Equation 1: 3x minus 8y equals negative 50, which checks out.

15
00:01:05.683 --> 00:01:11.024
Equation 2: 5x plus 2y equals 24, which checks out.