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

Hi may i know how 2 start with this proof by induction of fibonacci .

For n >= 1

[tex]

\sum_{i = 1} ^ n fib^2(n) = fib(n) * fib(n + 1)}

[/tex]

2. Relevant equations

3. The attempt at a solution

First step - Basic step i sub 1 to the equation.

Then i get

fib(1)^2 = fib(1) * fib(2)

1^2 = 1*1

1 = 1 (proof)

Second step i need to sub n - 1 into the equation. But i stuck at this step, anyone can guide me along how to continue ? Maybe can give me some link or tutorial on the induction. Because i still quite blur at how the proof by induction work. I google about the topic, but the examples still too hard for me to understand.

Thanks in advance.

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

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!

# Homework Help: Fib proof by induction

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