The numbers 1,2,3,5,8, ..... are called Fibonacci numbers. They may be defined by induction as n2 follows: a = 1, a = 2,..., an+1 = an + an-, if n 2. Prove that an = (+5) for every 2 n 1.