WEBVTT

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

2
00:00:08.890 --> 00:00:12.059
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.219 --> 00:00:33.495
Divide R1 by negative 2.

7
00:00:34.295 --> 00:00:36.942
Clear column 1 using the pivot in R1.

8
00:00:37.392 --> 00:00:39.261
Divide R2 by 9.

9
00:00:39.711 --> 00:00:42.602
Clear column 2 using the pivot in R2.

10
00:00:43.052 --> 00:00:44.886
Reduced row-echelon form.

11
00:00:45.686 --> 00:00:47.404
Read off the unique solution.

12
00:00:48.204 --> 00:00:52.001
So the answer is x equals 0, y equals 0.

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

14
00:00:58.801 --> 00:01:04.397
Equation 1: negative 2x minus 8y equals 0, which checks out.

15
00:01:04.847 --> 00:01:11.082
Equation 2: negative 3x minus 3y equals 0, which checks out.