WEBVTT

1
00:00:00.000 --> 00:00:08.057
Here is the problem: negative 2x minus y equals negative 12; 9x minus 3y equals 9.

2
00:00:08.507 --> 00:00:11.549
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.719 --> 00:00:32.995
Divide R1 by negative 2.

7
00:00:33.795 --> 00:00:36.454
Clear column 1 using the pivot in R1.

8
00:00:36.904 --> 00:00:40.352
Divide R2 by negative 15 over 2.

9
00:00:40.802 --> 00:00:43.658
Clear column 2 using the pivot in R2.

10
00:00:44.108 --> 00:00:46.059
Reduced row-echelon form.

11
00:00:46.859 --> 00:00:48.554
Read off the unique solution.

12
00:00:49.354 --> 00:00:53.487
So the answer is x equals 3, y equals 6.

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

14
00:01:00.391 --> 00:01:06.196
Equation 1: negative 2x minus y equals negative 12, which checks out.

15
00:01:06.646 --> 00:01:11.882
Equation 2: 9x minus 3y equals 9, which checks out.