- #1
teppel
- 4
- 0
Homework Statement
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]
Homework Equations
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.
Last edited: