WEBVTT

1
00:00:00.000 --> 00:00:07.570
Here is the problem: 4x minus y equals negative 15; 7x plus y equals negative 18.

2
00:00:08.020 --> 00:00:10.911
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.186 --> 00:00:31.997
Divide R1 by 4.

7
00:00:32.797 --> 00:00:35.560
Clear column 1 using the pivot in R1.

8
00:00:36.010 --> 00:00:38.494
Divide R2 by 11 over 4.

9
00:00:38.945 --> 00:00:41.789
Clear column 2 using the pivot in R2.

10
00:00:42.239 --> 00:00:44.004
Reduced row-echelon form.

11
00:00:44.804 --> 00:00:46.592
Read off the unique solution.

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

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

14
00:00:59.033 --> 00:01:04.490
Equation 1: 4x minus y equals negative 15, which checks out.

15
00:01:04.940 --> 00:01:10.431
Equation 2: 7x plus y equals negative 18, which checks out.