WEBVTT

1
00:00:00.000 --> 00:00:08.522
Here is the problem: negative 6x plus 3y equals 27; negative 7x plus 5y equals 30.

2
00:00:08.972 --> 00:00:11.991
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.162 --> 00:00:33.461
Divide R1 by negative 6.

7
00:00:34.261 --> 00:00:37.013
Clear column 1 using the pivot in R1.

8
00:00:37.463 --> 00:00:40.017
Divide R2 by 3 over 2.

9
00:00:40.467 --> 00:00:43.288
Clear column 2 using the pivot in R2.

10
00:00:43.738 --> 00:00:45.723
Reduced row-echelon form.

11
00:00:46.523 --> 00:00:48.253
Read off the unique solution.

12
00:00:49.053 --> 00:00:53.720
So the answer is x equals negative 5, y equals negative 1.

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

14
00:01:00.485 --> 00:01:06.708
Equation 1: negative 6x plus 3y equals 27, which checks out.

15
00:01:07.158 --> 00:01:12.847
Equation 2: negative 7x plus 5y equals 30, which checks out.