(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

If i want to use induction to prove the Fibonacci sequence I first check that 0 satisfies both sides of the equation. then i assume its true for n=k then show that it for works for n=k+1

3. The attempt at a solution

But im a little confused if i should add another term or just plug in k+1

so the Fibonacci sequence is [itex] F_{n}=F_{n-1}+F_{n-2} [/itex]

so then should k+1 be [itex] F_{k+1}= F_{k}+F_{k-1}+F_{k-2} [/itex]

or should it be[itex] F_{k+1}=F_{k}+F_{k-1} [/itex]

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Question about induction ?

**Physics Forums | Science Articles, Homework Help, Discussion**