WEBVTT

1
00:00:00.000 --> 00:00:08.789
Here is the problem: 2x minus 3y equals negative 15; negative x minus 7y equals negative 18.

2
00:00:09.239 --> 00:00:12.165
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.359 --> 00:00:33.193
Divide R1 by 2.

7
00:00:33.993 --> 00:00:36.686
Clear column 1 using the pivot in R1.

8
00:00:37.136 --> 00:00:40.514
Divide R2 by negative 17 over 2.

9
00:00:40.965 --> 00:00:43.821
Clear column 2 using the pivot in R2.

10
00:00:44.271 --> 00:00:46.198
Reduced row-echelon form.

11
00:00:46.998 --> 00:00:48.705
Read off the unique solution.

12
00:00:49.505 --> 00:00:53.882
So the answer is x equals negative 3, y equals 3.

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

14
00:01:00.774 --> 00:01:06.683
Equation 1: 2x minus 3y equals negative 15, which checks out.

15
00:01:07.134 --> 00:01:13.403
Equation 2: negative x minus 7y equals negative 18, which checks out.