| New Reply |
Sum of first n Fibonacci numbers with respect to n? |
Share Thread | Thread Tools |
| Jun23-11, 09:07 AM | #1 |
|
|
Sum of first n Fibonacci numbers with respect to n?
I know that the nth Fibonacci number is defined as:
[tex]\frac{{1+\sqrt{5}}^{n}-{1-\sqrt{5}}^{n}}{{2}^{n}\sqrt{5}}[/tex] But may I know the formula for the sum of the first n Fibonacci numbers with respect to n? Thanks. |
| Jun23-11, 09:31 AM | #2 |
|
|
Hi dimension10!
![]() That formula you give can't possibly be correct, since it evaluates to 0... Did you forget to add some brackets? Anyway, the most elegant formula for the sum of the first n Fibonacci numbers is [tex]F_0+F_1+...+F_n=F_{n+2}-1[/tex] Using the (correct) formula for [itex]F_{n+2}[/itex] gives you the desired formula. Check http://en.wikipedia.org/wiki/Fibonacci_number |
| Jun23-11, 09:49 AM | #3 |
|
Admin
|
Isn't it just an obvious application of
[tex]F_n = F_{n-1} + F_{n-2}[/tex] definition? |
| Jun23-11, 07:25 PM | #4 |
|
|
Sum of first n Fibonacci numbers with respect to n?[tex]\frac{{(1+\sqrt{5})}^{n}-{(1-\sqrt{5})}^{n}}{{2}^{n}\sqrt{5}}[/tex] |
| Jun23-11, 07:35 PM | #5 |
|
|
So we could write it as:
[tex]\frac{{(1+\sqrt{5})}^{n+2}-{(1-\sqrt{5})}^{n+2}}{{2}^{n+2}\sqrt{5}}-1[/tex] |
| New Reply |
| Thread Tools | |
Similar Threads for: Sum of first n Fibonacci numbers with respect to n?
|
||||
| Thread | Forum | Replies | ||
| Lucas Numbers/ Fibonacci Numbers Proof | Calculus & Beyond Homework | 3 | ||
| Fibonacci Numbers | Calculus & Beyond Homework | 0 | ||
| Fibonacci Numbers | Calculus & Beyond Homework | 1 | ||
| Where Fibonacci numbers surpass prime numbers | Linear & Abstract Algebra | 4 | ||