Question

Using induction, prove f_n=f_(n-1)+f_(n-2) for n>2

Answer 1

what is f_n ?

Answer 2

\[F_n= F_{n-1} + F_{n-2} , n>2\]
Am trying to prove the Fibonacci recurrence relation

Answer 3

You're going to need an initial value. You probably mean \(F_0=F_1=1\).

Answer 4

Set up the generation functions for \(F_n,F_{n-1},F_{n-2}\).