Problem #WSP-000217

Problems Methods Mathematical induction

Problem

The famous Fibonacci sequence is a sequence of numbers, which starts from two ones, and then each consecutive term is a sum of the previous two. It describes many things in nature. In a symbolic form we can write: F0=1,F1=1,Fn=Fn1+Fn2.
Show that F0+F1+F2++Fn=Fn+21