The Fibonacci Numbers form a sequence F with F0 = 0 and F1 = 1. The relationship between Fn+2, Fn, and Fn+1 is given by the recurrence relation:
F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, ...
Prove that the Fibonacci numbers satisfy the following matrix equation:
(b) marks) Compute the eigenvalues and corresponding eigenvectors for the matrix: A =
Give vour answers as exact values
(c) 2 marks) Using your answers from part (b) of this question; diagonalise the matrix A That is, find matrices P and D with D diagonal such that A = PDP-!
(d) (2 marks) Hence obtain a closed-form expression for Fn using the diagonalisation found in part (c) and the equation (1).