WEBVTT

1
00:00:00.000 --> 00:00:08.475
Here is the problem: 2x minus 4y equals 8; negative 5x plus 5y equals negative 25.

2
00:00:08.925 --> 00:00:11.920
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.870 --> 00:00:32.553
Divide R1 by 2.

7
00:00:33.353 --> 00:00:36.023
Clear column 1 using the pivot in R1.

8
00:00:36.473 --> 00:00:38.992
Divide R2 by negative 5.

9
00:00:39.442 --> 00:00:42.286
Clear column 2 using the pivot in R2.

10
00:00:42.736 --> 00:00:44.501
Reduced row-echelon form.

11
00:00:45.301 --> 00:00:46.996
Read off the unique solution.

12
00:00:47.796 --> 00:00:51.685
So the answer is x equals 6, y equals 1.

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

14
00:00:58.461 --> 00:01:03.337
Equation 1: 2x minus 4y equals 8, which checks out.

15
00:01:03.787 --> 00:01:10.381
Equation 2: negative 5x plus 5y equals negative 25, which checks out.