Question

Prove that walk(n) = fn+1 for all n greater than or equal to 1

Answer 1

better formatting
\[walk(n) = f _{n+1}\]

Answer 2

i know its an induction proof but the part im at is trying to show that
walk(k+1) = [f _{k+2}\]
and im assuming ive done everything correctly i just can think of how to manipulate the left hand side and make it look like the right hand side

Answer 3

\[walk(k+1) = f _{k+2}\]
not sure what happened above but this is what im pretty sure im trying to prove