Fibonacci Formula: Find Nth Term in Sequence

  • Context: High School 
  • Thread starter Thread starter brandy
  • Start date Start date
  • Tags Tags
    Formula
Click For Summary
SUMMARY

The Fibonacci sequence can be expressed using a closed formula derived from its recursive definition. The nth term, F_n, can be calculated using the formula F_n = A(φ^n) + B(ψ^n), where φ = (1 + √5)/2 and ψ = (1 - √5)/2. To find the constants A and B, one can use the initial conditions F_0 = 1 and F_1 = 1, leading to a system of equations. Solving these equations through substitution provides the values for A and B, allowing for the computation of any term in the Fibonacci sequence.

PREREQUISITES
  • Understanding of Fibonacci sequence and its recursive definition
  • Basic knowledge of linear algebra, particularly matrix diagonalization
  • Familiarity with solving quadratic equations
  • Ability to manipulate simultaneous equations
NEXT STEPS
  • Study matrix diagonalization techniques in linear algebra
  • Learn about the derivation of closed-form solutions for recursive sequences
  • Explore the application of the quadratic formula in solving equations
  • Practice solving simultaneous equations using substitution and elimination methods
USEFUL FOR

Mathematicians, computer scientists, and anyone interested in algorithm design or mathematical modeling, particularly those working with recursive sequences and linear algebra.

brandy
Messages
156
Reaction score
0
im just curious. is there a formula for the fibonacci formula in terms of..well terms. like the nth term =..?
iv been trying to figure it out for a couple of days now but am not that smart.
 
Mathematics news on Phys.org
You could derive it, if you know enough elementary linear algebra and in particular diagonalisation of matrices. It's not that difficult. You start off with recursive definition of the n+1 and nth term and n-1 term, put them all into a matrix and show that it is diagonalisable, then write out the matrix equation.
 
done the algebra but have only learned +-x/ matrices.
how does the n+1 thing work
like i said am not that smart.
 
The terms in a Fibonacci sequence obey the recursive rule Fn+2= Fn+1+ Fn. One common way of solving such equations is to try a solution of the form Fn= an. Then Fn+1= an+1 and Fn+2= an+2 so the equation becomes an+2= an+1+ an. Dividing by an gives a2= a+ 1 or a2- a- 1= 0. Solving that by the quadratic formula,
a= \frac{1\pm\sqrt{5}}{2}
In other words,
F_n= \left(\frac{1+\sqrt{5}}{2}\right)^n
and
F_n= \left(\frac{1-\sqrt{5}}{2}\right)^n
both satisfy Fn+2= Fn+1+ Fn.

Since that is a linear equation, any solution of that equation can be written
A\left(\frac{1+\sqrt{5}}{2}\right)^n+ B\left(\frac{1-\sqrt{5}}{2}\right)^n

Now, looking at the first two terms of the Fibonacci sequence
F_0= A+ B= 1
and
F_1=A\left(\frac{1+\sqrt{5}}{2}\right)+ B\left(\frac{1-\sqrt{5}}{2}\right)= 1
gives two equations to solve for A and B.
 
Sorry for the bump, but could you show me how you would solve for A and B?

I'm not able to solve simultaneous equations in this form;

A + B = 1
Ax + By = 1

Thanks.
 
Simply let B=1-A and then substitute this into the second equation, solve for A there and then substitute back into the first to find B.
 
Of course! Solving by substitution. Thanks, I forgot about doing that.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 41 ·
2
Replies
41
Views
10K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K