I Finding a general formula for a recursive sequence

AI Thread Summary
The discussion explores finding a general formula for recursive sequences, particularly focusing on the Fibonacci sequence defined by an = an-1 + an-2. It explains that the characteristic equation, derived from assuming a solution of the form an = x^n, is essential for solving such recurrences. For the Fibonacci sequence, the characteristic equation is x^2 - x - 1 = 0, which yields roots related to the golden ratio. The general solution can be expressed as a linear combination of these roots, allowing for the determination of specific terms using initial conditions. This method parallels techniques used in solving nth order linear homogeneous differential equations.
Trollfaz
Messages
143
Reaction score
14
The general formula for the nth term of the Fibonacci sequence where an=an-1+an-2 can determined by matrix diagonalizations
Is there a way to determine the formula of any recursive sequence say
an=a1+a2+...an-1
 
Mathematics news on Phys.org
Trollfaz said:
The general formula for the nth term of the Fibonacci sequence where an=an-1+an-2 can determined by matrix diagonalizations
Is there a way to determine the formula of any recursive sequence say
an=a1+a2+...an-1
https://en.wikipedia.org/wiki/Linear_recurrence_with_constant_coefficients

You solve these by finding the characteristic equation, solving that and using it to derive solutions as a linear combination of exponentials (or, when the solutions involve complex numbers, of sines, cosines and exponentials).

For Fibonacci: ##a_n=a_{n-1} + a_{n-2}##, the characteristic equation is ##x^2=x+1##. The characteristic equation can be found by assuming that the solution takes the form: ##a_n=x^n## and expressing the recurrence in terms of ##x##.

This recurrence has two terms on the right, so it is second order. Its characteristic equation is a quadratic. A recurrence with n terms on the right is "nth order". The chacteristic equation will be a polynomial equation of the nth degree.

So one has the polynomial equation in standard form: ##x^2 - x - 1 = 0##. This is a quadratic, so we can solve it with the quadratic formula to obtain ##x=\frac{-b \pm \sqrt{b^2-4ac}}{2a}##. The two roots should be approximately 1.61803 and -0.61803. Call these ##r_1## and ##r_2##. [These turn out to be the golden ratio ##\phi## and the additive inverse of its reciprocal. The matching decimal digits is not a coincidence. It is one of the properties of the golden ratio].

The solution to the original Fibonacci recurrence will be a linear combination: ##a_n = k_1{r_1}^n + k_2{r_2}^n##. If you have the two starting terms for the recurrence, you can solve a set of simultaneous equations (via matrix algebra if you like) for ##k_1## and ##k_2##.

The starting terms were referred to as "boundary conditions" when I learned this stuff. It is very much akin to solving nth order linear homogenous differential equations.
 
Last edited:
  • Like
  • Informative
Likes DrClaude and mfb
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...

Similar threads

Back
Top