# Question: if fn represents the nth fibonacci number prove by induction...

###### Question details

If Fn represents the n-th Fibonacci number, prove by induction that F1+F3+F5+....F2n-1=Fn for all positive integers n. Clear step by step communication of solution would be helpful.