How can I write a Fibonacci sequence using summation notation?

dba
Messages
29
Reaction score
0

Homework Statement


I have trouble with the summation notation.

\sum_{i=0}^{k}\binom{k}{i}f_{n+i}

How do I write this as a sequence based on the definition of Fibonacci sequence?

Homework Equations


Definition:
f(0)=0
f(1)=1
f(n)=f(n-1) + f(n-2) for n>=2

Example:
f(2) = f(1) + f(0) = 1+0 = 1
f(3) = f(2) + f(1) = 1+1 = 2
f(4) = f(3) + f(2) = 2+1 = 3
f(5) = f(4) + f(3) = 3+2 = 5
and so on

The Attempt at a Solution


I know how to write:

\sum_{i=1}^{n}(i) = 1+2+3+...+n

but I do not understand how to write the following Fibonacci sequence:

\sum_{i=0}^{k}\binom{k}{i}f_{n+i}

Can someone show me how to write this as an expanded version or give me an example how to do this?
Thank you.
 
Physics news on Phys.org
\begin{pmatrix}n \\ i\end{pmatrix} is the "binomial coefficient"
\frac{n!}{i! (n-i)!}
\sum_{i=0}^k \begin{pmatrix}k\\ i \end{pmatrix}f_{n+i}= f_n+ kf_{n+1}+ (k(k-1)/2)f_{n+2}+ \cdot\cdot\cdot

So, for example, with k= 3
\sum_{i=0}^3\begin{pmatrix}3 \\ i\end{pmatrix}f_{n+i}= f_n+ 3f_{n+1}+ 3f_{n+2}+ f_{n+3}
 
Thank you very much.
I understand this now :smile:
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top