WEBVTT

1
00:00:00.000 --> 00:00:07.593
Here is the problem: negative 6x minus 8y equals 0; 2x minus 4y equals 0.

2
00:00:08.043 --> 00:00:11.015
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.046 --> 00:00:32.438
Divide R1 by negative 6.

7
00:00:33.238 --> 00:00:35.978
Clear column 1 using the pivot in R1.

8
00:00:36.428 --> 00:00:39.656
Divide R2 by negative 20 over 3.

9
00:00:40.106 --> 00:00:42.962
Clear column 2 using the pivot in R2.

10
00:00:43.412 --> 00:00:45.328
Reduced row-echelon form.

11
00:00:46.128 --> 00:00:47.881
Read off the unique solution.

12
00:00:48.681 --> 00:00:52.350
So the answer is x equals 0, y equals 0.

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

14
00:00:59.010 --> 00:01:04.536
Equation 1: negative 6x minus 8y equals 0, which checks out.

15
00:01:04.986 --> 00:01:09.990
Equation 2: 2x minus 4y equals 0, which checks out.