WEBVTT

1
00:00:00.000 --> 00:00:03.297
Here is the problem: A plus B: A equals [[1, 2], [3, 4]].

2
00:00:03.747 --> 00:00:05.686
Compute A plus B exactly.

3
00:00:06.486 --> 00:00:07.879
Read matrix A.

4
00:00:08.329 --> 00:00:09.606
Read matrix B.

5
00:00:10.056 --> 00:00:11.530
Add matching entries.

6
00:00:11.980 --> 00:00:12.607
Result.

7
00:00:13.407 --> 00:00:15.903
So the answer is A plus B equals [[2, 3], [4, 5]].

8
00:00:16.353 --> 00:00:22.379
Addition and subtraction work entry by entry and require matrices of the same size.

9
00:00:23.179 --> 00:00:26.430
All arithmetic is exact (fractions, no rounding).