WEBVTT

1
00:00:00.000 --> 00:00:07.407
Here is the problem: 2x minus 5y equals 19; x minus 5y equals 22.

2
00:00:07.857 --> 00:00:10.934
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.000 --> 00:00:31.695
Divide R1 by 2.

7
00:00:32.495 --> 00:00:35.177
Clear column 1 using the pivot in R1.

8
00:00:35.627 --> 00:00:38.796
Divide R2 by negative 5 over 2.

9
00:00:39.247 --> 00:00:42.045
Clear column 2 using the pivot in R2.

10
00:00:42.495 --> 00:00:44.248
Reduced row-echelon form.

11
00:00:45.048 --> 00:00:46.697
Read off the unique solution.

12
00:00:47.497 --> 00:00:52.234
So the answer is x equals negative 3, y equals negative 5.

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

14
00:00:59.010 --> 00:01:04.385
Equation 1: 2x minus 5y equals 19, which checks out.

15
00:01:04.835 --> 00:01:10.234
Equation 2: x minus 5y equals 22, which checks out.