WEBVTT

1
00:00:00.000 --> 00:00:06.780
Here is the problem: y equals 3x minus 5; 2x plus y equals 10.

2
00:00:07.230 --> 00:00:10.341
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:29.362 --> 00:00:31.835
Divide R1 by negative 3.

7
00:00:32.635 --> 00:00:35.317
Clear column 1 using the pivot in R1.

8
00:00:35.767 --> 00:00:38.391
Divide R2 by 5 over 3.

9
00:00:38.841 --> 00:00:41.720
Clear column 2 using the pivot in R2.

10
00:00:42.170 --> 00:00:44.004
Reduced row-echelon form.

11
00:00:44.804 --> 00:00:46.464
Read off the unique solution.

12
00:00:47.264 --> 00:00:51.269
So the answer is x equals 3, y equals 4.

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

14
00:00:58.011 --> 00:01:03.920
Equation 1: negative 3x plus y equals negative 5, which checks out.

15
00:01:04.371 --> 00:01:09.131
Equation 2: 2x plus y equals 10, which checks out.