WEBVTT

1
00:00:00.000 --> 00:00:06.467
Here is the problem: 0.5x plus y equals 2; x minus y equals 1.

2
00:00:06.917 --> 00:00:09.982
2 linear equations in 2 unknowns (x, y).

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

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

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

6
00:00:28.781 --> 00:00:30.964
Divide R1 by 1 over 2.

7
00:00:31.764 --> 00:00:34.516
Clear column 1 using the pivot in R1.

8
00:00:34.966 --> 00:00:37.497
Divide R2 by negative 3.

9
00:00:37.947 --> 00:00:40.757
Clear column 2 using the pivot in R2.

10
00:00:41.207 --> 00:00:43.018
Reduced row-echelon form.

11
00:00:43.818 --> 00:00:45.478
Read off the unique solution.

12
00:00:46.278 --> 00:00:49.970
So the answer is x equals 2, y equals 1.

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

14
00:00:56.920 --> 00:01:01.959
Equation 1: (1 over 2)x plus y equals 2, which checks out.

15
00:01:02.409 --> 00:01:07.146
Equation 2: x minus y equals 1, which checks out.