WEBVTT

1
00:00:00.000 --> 00:00:07.570
Here is the problem: 3x plus 7y equals 22; 8x plus 7y equals 47.

2
00:00:08.020 --> 00:00:11.108
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.023 --> 00:00:31.857
Divide R1 by 3.

7
00:00:32.657 --> 00:00:35.350
Clear column 1 using the pivot in R1.

8
00:00:35.800 --> 00:00:39.445
Divide R2 by negative 35 over 3.

9
00:00:39.896 --> 00:00:42.775
Clear column 2 using the pivot in R2.

10
00:00:43.225 --> 00:00:45.106
Reduced row-echelon form.

11
00:00:45.906 --> 00:00:47.636
Read off the unique solution.

12
00:00:48.436 --> 00:00:52.174
So the answer is x equals 5, y equals 1.

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

14
00:00:58.950 --> 00:01:04.000
Equation 1: 3x plus 7y equals 22, which checks out.

15
00:01:04.450 --> 00:01:10.081
Equation 2: 8x plus 7y equals 47, which checks out.