00:01
Hi, it is given that fibonacci sequences f1, f2 is defined as f1 equal to 1, f2 equal to 1 and fn equal to fn minus 2 plus fn minus 1 for n is greater than or equal to 3.
00:19
The objective is to determine proof of the all parts.
00:22
So, solving for part a, we have to show tn of 0 ,1 equal to fn comma fn plus 1.
00:32
Now, using the mathematics induction, we have t1 of 0 ,1 equal to 1 ,0 plus 1 equal to 1 ,1 which is equal to f1 and f2 as per the given information.
00:45
Now, assume that tk of 0 ,1 equal to fk and fk plus 1 for some positive integer k.
00:57
We need to show that tk plus 1 of 0 ,1 equal to f of fk ,1 and fk plus 2 as fk plus 2 equal to fk plus f of k plus 1 from the definition of sequence.
01:21
Therefore, we have tk plus 1 of 0 ,1 equal to fk plus 1, fk plus 2.
01:31
So, by mathematical induction, we have tn of 0 ,1 equal to fn and fn plus 1 for each positive integer n.
01:41
Now, moving to the part b, to find the eigenvalues of t, we need to solve the characteristic equation that is determinant of t minus lambda i equal to 0, where i is the identity matrix.
02:03
So, t minus lambda i equal to minus lambda 1, 1 minus lambda.
02:09
So, the determinant is minus lambda into minus lambda minus 1 equal to lambda square minus 1 which is equal to 0...