WEBVTT

1
00:00:00.000 --> 00:00:08.638
Here is the problem: 4x minus 7y equals 17; negative 2x minus 8y equals 26.

2
00:00:09.088 --> 00:00:12.153
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.091 --> 00:00:32.902
Divide R1 by 4.

7
00:00:33.702 --> 00:00:36.430
Clear column 1 using the pivot in R1.

8
00:00:36.880 --> 00:00:40.467
Divide R2 by negative 23 over 2.

9
00:00:40.917 --> 00:00:43.877
Clear column 2 using the pivot in R2.

10
00:00:44.328 --> 00:00:46.127
Reduced row-echelon form.

11
00:00:46.928 --> 00:00:48.635
Read off the unique solution.

12
00:00:49.435 --> 00:00:54.125
So the answer is x equals negative 1, y equals negative 3.

13
00:00:54.575 --> 00:01:00.090
The system has exactly one solution; substituting it back satisfies every equation.

14
00:01:00.890 --> 00:01:06.289
Equation 1: 4x minus 7y equals 17, which checks out.

15
00:01:06.739 --> 00:01:12.567
Equation 2: negative 2x minus 8y equals 26, which checks out.