How can I write a Fibonacci sequence using summation notation?

Click For Summary
SUMMARY

The discussion focuses on expressing the Fibonacci sequence using summation notation, specifically the formula \(\sum_{i=0}^{k}\binom{k}{i}f_{n+i}\). The Fibonacci sequence is defined by \(f(0)=0\), \(f(1)=1\), and \(f(n)=f(n-1) + f(n-2)\) for \(n \geq 2\). An example provided illustrates how to expand the summation for \(k=3\), resulting in \(f_n + 3f_{n+1} + 3f_{n+2} + f_{n+3}\). The user successfully grasped the concept after receiving clarification on the binomial coefficient and its application in the Fibonacci context.

PREREQUISITES
  • Understanding of Fibonacci sequence definitions and properties
  • Knowledge of summation notation and binomial coefficients
  • Familiarity with mathematical induction and recursive functions
  • Basic combinatorial mathematics
NEXT STEPS
  • Study the properties of binomial coefficients in combinatorial mathematics
  • Learn how to derive Fibonacci numbers using matrix exponentiation
  • Explore generating functions for Fibonacci sequences
  • Investigate the application of Fibonacci sequences in algorithm design
USEFUL FOR

Students studying discrete mathematics, mathematicians interested in combinatorial identities, and educators teaching Fibonacci sequences and 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:
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 8 ·
Replies
8
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 18 ·
Replies
18
Views
2K
Replies
4
Views
2K