WEBVTT

1
00:00:00.000 --> 00:00:07.906
Here is the problem: x minus 9y equals negative 42; 7x plus 5y equals 46.

2
00:00:08.356 --> 00:00:11.444
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.627 --> 00:00:33.321
Clear column 1 using the pivot in R1.

7
00:00:34.121 --> 00:00:36.304
Divide R2 by 68.

8
00:00:36.754 --> 00:00:39.552
Clear column 2 using the pivot in R2.

9
00:00:40.002 --> 00:00:41.941
Reduced row-echelon form.

10
00:00:42.391 --> 00:00:44.156
Read off the unique solution.

11
00:00:44.956 --> 00:00:48.996
So the answer is x equals 3, y equals 5.

12
00:00:49.446 --> 00:00:55.135
The system has exactly one solution; substituting it back satisfies every equation.

13
00:00:55.935 --> 00:01:01.752
Equation 1: x minus 9y equals negative 42, which checks out.

14
00:01:02.202 --> 00:01:07.717
Equation 2: 7x plus 5y equals 46, which checks out.