WEBVTT

1
00:00:00.000 --> 00:00:08.034
Here is the problem: negative 9x plus 5y equals negative 61; 8x plus y equals 27.

2
00:00:08.484 --> 00:00:11.491
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.417 --> 00:00:32.832
Divide R1 by negative 9.

7
00:00:33.632 --> 00:00:36.395
Clear column 1 using the pivot in R1.

8
00:00:36.845 --> 00:00:40.142
Divide R2 by 49 over 9.

9
00:00:40.592 --> 00:00:43.460
Clear column 2 using the pivot in R2.

10
00:00:43.910 --> 00:00:45.826
Reduced row-echelon form.

11
00:00:46.626 --> 00:00:48.344
Read off the unique solution.

12
00:00:49.144 --> 00:00:53.405
So the answer is x equals 4, y equals negative 5.

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

14
00:01:00.205 --> 00:01:06.254
Equation 1: negative 9x plus 5y equals negative 61, which checks out.

15
00:01:06.704 --> 00:01:12.010
Equation 2: 8x plus y equals 27, which checks out.