Here's a simple proof.
QED
If you want to try induction, try
And so on......
Prove that the sum of the first n Fibonacci numbers is equal to the (n+2)nd fibonacci number minus one.
Base case: n=1
1st Fib# =1 =third fib# -1=2-1 True
This is where I have problems.
after this I have no idea how to proceed.