WEBVTT

1
00:00:00.000 --> 00:00:08.475
Here is the problem: negative 6x plus 6y equals 6; negative 5x minus 5y equals 5.

2
00:00:08.925 --> 00:00:12.083
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:31.289 --> 00:00:33.599
Divide R1 by negative 6.

7
00:00:34.399 --> 00:00:37.116
Clear column 1 using the pivot in R1.

8
00:00:37.566 --> 00:00:39.807
Divide R2 by negative 10.

9
00:00:40.257 --> 00:00:43.125
Clear column 2 using the pivot in R2.

10
00:00:43.575 --> 00:00:45.317
Reduced row-echelon form.

11
00:00:46.117 --> 00:00:47.754
Read off the unique solution.

12
00:00:48.554 --> 00:00:52.559
So the answer is x equals negative 1, y equals 0.

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

14
00:00:59.440 --> 00:01:04.792
Equation 1: negative 6x plus 6y equals 6, which checks out.

15
00:01:05.242 --> 00:01:11.221
Equation 2: negative 5x minus 5y equals 5, which checks out.