WEBVTT

1
00:00:00.000 --> 00:00:07.674
Here is the problem: 3x minus 4y equals 15; x plus 4y equals negative 27.

2
00:00:08.124 --> 00:00:11.038
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:30.092 --> 00:00:31.938
Divide R1 by 3.

7
00:00:32.738 --> 00:00:35.501
Clear column 1 using the pivot in R1.

8
00:00:35.951 --> 00:00:38.726
Divide R2 by 16 over 3.

9
00:00:39.176 --> 00:00:42.032
Clear column 2 using the pivot in R2.

10
00:00:42.482 --> 00:00:44.316
Reduced row-echelon form.

11
00:00:45.116 --> 00:00:46.834
Read off the unique solution.

12
00:00:47.634 --> 00:00:52.638
So the answer is x equals negative 3, y equals negative 6.

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

14
00:00:59.554 --> 00:01:05.022
Equation 1: 3x minus 4y equals 15, which checks out.

15
00:01:05.472 --> 00:01:10.998
Equation 2: x plus 4y equals negative 27, which checks out.