Finding the formula for the fibunacci sequence

  • Thread starter Thread starter Susanne217
  • Start date Start date
  • Tags Tags
    Formula Sequence
Click For Summary
SUMMARY

The forum discussion focuses on deriving the formula for the Fibonacci sequence using the generating function \(\frac{1}{-x^2-x+1} = \sum_{j=0}^{\infty} F_{j} x^{j}\). Participants confirm that the recursive relation for Fibonacci numbers is \(F_j = F_{j-1} + F_{j-2}\) and derive the roots \(r_1 = \frac{\sqrt{5}-1}{2}\) and \(r_2 = \frac{-(\sqrt{5}+1)}{2}\). The final formula for the \(j\)-th Fibonacci number is established as \(F_j = \frac{1}{\sqrt{5}} \left( \left( \frac{\sqrt{5}+1}{2} \right)^{j+1} - \left( \frac{-(\sqrt{5}+1)}{2} \right)^{j+1} \right)\) for \(j \geq 2.

PREREQUISITES
  • Understanding of generating functions in mathematics
  • Familiarity with the Fibonacci sequence and its recursive definition
  • Knowledge of solving quadratic equations
  • Basic concepts of limits and convergence in series
NEXT STEPS
  • Study the derivation of generating functions in combinatorial mathematics
  • Learn about the properties and applications of the Fibonacci sequence
  • Explore the Binet's formula for Fibonacci numbers
  • Investigate the implications of the golden ratio in Fibonacci sequences
USEFUL FOR

Mathematicians, computer scientists, and students studying sequences and series, particularly those interested in combinatorial mathematics and algorithm design.

Susanne217
Messages
311
Reaction score
0
1 If I am given the function [tex]\frac{1}{-x^2-x+1} = \sum_{j=0}^{\infty} F_{j} x^{j}[/tex]

Which discribes a sequence of fibunacci numbers 1,1,2,3,5,8,13,21...

Find the formula for the fibunacci sequence for n>=2 and where [tex]F_j = F_{j-1}+F_{j-2}[/tex]

Homework Equations





The Attempt at a Solution



I know that the recusive relation can be written as [tex]F_j = \alpha_1(r_1)^j + \alpha_2 (r_2)^j[/tex]


With the inital conditions [tex]F_0 = F_1 = 1[/tex]

Since the poles of the function are [tex]r_1 = \frac{\sqrt{5}-1}{2}[/tex] and [tex]r_2 = \frac{-(\sqrt{5}+1)}{2}[/tex]


which gives me the expression [tex]F_j = \alpha_1(\frac{\sqrt{5}-1}{2})^n + \alpha_2 (\frac{-(\sqrt{5}+1)}{2}})^n[/tex]

so this gives me [tex]F_0 = \alpha_1 + \alpha_2 = 1[/tex]

and [tex]F_1 = \alpha_1(\frac{\sqrt{5}-1}{2}) + \alpha_2 (\frac{-(\sqrt{5}+1)}{2}}) = 1[/tex] and I end up with

[tex]\alpha_1, \alpha_2 = \pm \frac{1}{\sqrt{5}}[/tex]

and this j >= 2 then the formula for the jth fibunacci number must

[tex]F_j = \frac{1}{\sqrt{5}}(\frac{\sqrt{5}+1}{2})^{j+1} -\frac{1}{\sqrt{5}} (\frac{-(\sqrt{5}+1)}{2}})^{j+1}[/tex]

How is that HallsoftIvy?

Susanne
 
Last edited:
Physics news on Phys.org
Susanne217 said:
1 If I am given the function [tex]\frac{1}{-x^2-x+1} = \sum_{j=0}^{\infty} F_{j} x^{j}[/tex]

Which discribes a sequence of fibunacci numbers 1,1,2,3,5,8,13,21...

Find the formula for the fibunacci sequence for n>=2 and where [tex]F_j = F_{n-1}+F_{n-2}[/tex]

You mean [tex]F_n= F_{n-1}+ F_{n-2}[/tex]

Homework Equations





The Attempt at a Solution



I know that the recusive relation can be written as [tex]F_n = \alpha_1(r_1)^n + \alpha_2 (r_2)^n[/tex]
Okay, so its just a matter of finding [tex]r_1[/tex] and [tex]r_2[/tex]. If [tex]F_n= r^n[/tex] the equation [tex]F_n= F_{n-1}+ F_{n-2}[/tex] becomes [tex]r^n= r^{n-1}+ r^{n-2}[/tex]. Dividing that equation by [tex]r^{n-1}[/tex] gives [tex]r^2= r+ 1[/tex]. What are the roots of that equation?

No fair! You edited and added your solution while I was responding!
 
HallsofIvy said:
You mean [tex]F_n= F_{n-1}+ F_{n-2}[/tex]


Okay, so its just a matter of finding [tex]r_1[/tex] and [tex]r_2[/tex]. If [tex]F_n= r^n[/tex] the equation [tex]F_n= F_{n-1}+ F_{n-2}[/tex] becomes [tex]r^n= r^{n-1}+ r^{n-2}[/tex]. Dividing that equation by [tex]r^{n-1}[/tex] gives [tex]r^2= r+ 1[/tex]. What are the roots of that equation?

No fair! You edited and added your solution while I was responding!

Sorry HallsoftIvy :)
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
Replies
20
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
1
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K