Recursive series for sum of 2 powers

  • Context: Graduate 
  • Thread starter Thread starter ramsey2879
  • Start date Start date
  • Tags Tags
    Series Sum
Click For Summary
SUMMARY

The discussion focuses on the recursive series defined by S_{n} = c*S_{n-1} - d*S_{n-2}, where c = a + b and d = ab, yielding the explicit formula S_{n} = a^{n} + b^{n}. The proof involves finding the roots e and f of the characteristic equation u^{2} - c*u + d = 0, leading to the conclusion that A = B = 1, with e = a and f = b. The generating function S(x) is also derived, demonstrating the relationship between the recursive definition and the explicit formula.

PREREQUISITES
  • Understanding of recursive sequences and series
  • Familiarity with characteristic equations and roots
  • Knowledge of generating functions in mathematics
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study the properties of generating functions in combinatorics
  • Explore advanced topics in recursive relations and their applications
  • Learn about induction proofs in mathematical sequences
  • Investigate the implications of the explicit formula S_{n} = a^{n} + b^{n} in number theory
USEFUL FOR

Mathematicians, computer scientists, and students studying sequences and series, particularly those interested in recursive relations and generating functions.

ramsey2879
Messages
841
Reaction score
3
Has anyone seen this before? It must have been noted before!

Let c = a+b and d = ab Then the series [tex]S_{n} = c*S_{n-1} - d*S_{n-2}[/tex] having the values 2 and c for [tex]S_0[/tex] and [tex]S_1[/tex] has the explicit formula
[tex]S_{n} = a^{n} + b^{n}[/tex].

Proof

The Explicit formula for the above recursive series is found by finding the roots e and f of the equation [tex]u^{2} - c*u + d = 0[/tex] and solving the set of equations:

[tex]2 = A + B[/tex] and
[tex]c = Ae + Bf[/tex] from which we determine that
[tex]S_{n} = Ae^{n} + Bf^{n}[/tex]

We need to show that A = B = 1, e = a and f = b.

Now e,f = (c +/- Sq root[(c)^{2} - 4ab])/2 = (a+b +/- (a-b))/2 = a,b

Solving the set of equations we also see that A=B=1. Q.E.D.

Most likely the proof could be done by induction also, but I wanted to focus on the general theory of recursive series.
 
Last edited:
Physics news on Phys.org
It can be done using the generating function for the sequence [tex]S_n[/tex]. It's defined as:

[tex] S\left(x\right) = \sum_{n=0}^{\infty}S_{n}x^{-n}[/tex]

An explicit expression for [tex]S\left(x\right)[/tex] may be obtained from the recursion plus a few properties:

[tex] S_0 = 2, S_1=c<br /> <br /> S_{n+2} = cS_{n+1}-dS_{n}[/tex]

From this, we have:

[tex] x^{2}\left(S\left(x\right)-cx^{-1}-2\right)=cx\left(S\left(x\right)-2\right)-dS\left(x\right) \Leftrightarrow S\left(x\right)-cx^{-1}-2=cx^{-1}\left(S\left(x\right)-2\right)-dx^{-2}S\left(x\right)\Leftrightarrow S\left(x\right)\left(dx^{-2}-cx^{-1}+1\right)=-cx^{-1}+2 \Leftrightarrow<br /> S\left(x\right)=\frac{-cx^{-1}+2}{dx^{-2}-cx^{-1}+1}=x\frac{2x-c}{d-cx+x^{2}}[/tex]

Now, if [tex]c=a+b[/tex] and [tex]d = ab[/tex], then the denominator roots' are [tex]a[/tex] and [tex]b[/tex]; therefore [tex]S\left(x\right)[/tex] can be split as:

[tex] S\left(x\right) = \frac{A}{1-ax^{-1}}+\frac{B}{1-bx^{-1}}[/tex]

Where [tex]A=\frac{2a-c}{a-b}[/tex] and [tex]B=\frac{2b-c}{b-a}[/tex]. Furthermore, the sequences corresponding to a factor with the form:

[tex] \frac{1}{1-cx^{-1}}[/tex]

Are [tex]c^n[/tex]. Therefore, the general form of your sequence is:

[tex] S_n = \frac{2a-c}{a-b}\times a^n + \frac{2b-c}{b-a}\times b^n[/tex]

Now, from c=a+b and the initial terms, you may deduce the rest.
 
Last edited:

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K