1. Fibonacci numbers are defined recursively as follows: F0 = 0 F1 = 1 Fn = Fn1 + Fn2 Show the following property of Fibonacci numbers by induction. For every n 1, F 2 1 + F 2 2 + F 2 3 + + F 2 n = Fn Fn+1. Your proof must use mathematical induction; otherwise you will receive zero credit.

1. Fibonacci numbers are defined recursively as follows Fo = 0 E, Fn-1 +Fn-2 = Show the following property of Fibonacci numbers by induction. For every n21, induction; otherwise you will receive zero credit