WEBVTT

1
00:00:00.000 --> 00:00:04.110
Here is the problem: A to the power n (power): A equals [[2, 1], [1, 3]].

2
00:00:04.560 --> 00:00:07.056
Compute A to the power n (power) exactly.

3
00:00:07.856 --> 00:00:09.214
Read matrix A.

4
00:00:09.664 --> 00:00:11.719
Multiply again: power 2.

5
00:00:12.169 --> 00:00:14.456
Multiply again: power 3.

6
00:00:14.906 --> 00:00:15.579
Result.

7
00:00:16.379 --> 00:00:20.802
So the answer is A to the power n (power) equals [[15, 20], [20, 35]].

8
00:00:21.252 --> 00:00:25.014
A cubed is computed by repeated exact multiplication.

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