WEBVTT

1
00:00:00.000 --> 00:00:09.648
Here is the problem: 5x minus 6y equals negative 3 over 2; negative 7x minus 9y equals 63.

2
00:00:10.098 --> 00:00:13.151
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:32.252 --> 00:00:34.098
Divide R1 by 5.

7
00:00:34.898 --> 00:00:37.603
Clear column 1 using the pivot in R1.

8
00:00:38.053 --> 00:00:41.594
Divide R2 by negative 87 over 5.

9
00:00:42.044 --> 00:00:44.923
Clear column 2 using the pivot in R2.

10
00:00:45.373 --> 00:00:47.300
Reduced row-echelon form.

11
00:00:48.100 --> 00:00:49.899
Read off the unique solution.

12
00:00:50.700 --> 00:00:56.517
So the answer is x equals negative 9 over 2, y equals negative 7 over 2.

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

14
00:01:03.235 --> 00:01:09.516
Equation 1: 5x minus 6y equals negative 3 over 2, which checks out.

15
00:01:09.966 --> 00:01:16.328
Equation 2: negative 7x minus 9y equals 63, which checks out.