00:01
In this problem, we need to show that a n is n squared given the values of a1, a2, and a3, and given a k for all k greater than or equal to 4.
00:10
So let's assume that t n is the statement that a n is equal to n squared.
00:16
We're going to prove that this holds for all positive integers n using the principle of mathematical induction.
00:22
First of all, let's consider the base step.
00:24
So let's see if t1 holds, so a1 will be 1 squared, that is 1, and a1 is given to be 1, so that means that t1 holds.
00:36
Now next we are going to move on to the inductive step.
00:42
So we're going to assume that t1, t2, up to tk holds for some positive integer, and using this we're going to prove that tk plus 1 also holds.
00:59
So we need to show that ak plus 1 is equal to k plus 1 squared.
01:03
Now let's consider the recursive formula that ak is ak minus 1 minus ak minus 2 plus ak minus 3 plus 2 times 2k minus 3 and we replace k by k plus 1.
01:13
So we end up with ak plus 1 is equal to ak minus ak minus 1 plus ak minus 2 plus 2 times 2 times k plus 1 minus 3.
01:24
Now t1, t2, up to tk holes...