Recursive series for sum of 2 powers

  • Thread starter Thread starter ramsey2879
  • Start date Start date
  • Tags Tags
    Series Sum
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 S_{n} = c*S_{n-1} - d*S_{n-2} having the values 2 and c for S_0 and S_1 has the explicit formula
S_{n} = a^{n} + b^{n}.

Proof

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

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

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 S_n. It's defined as:

<br /> S\left(x\right) = \sum_{n=0}^{\infty}S_{n}x^{-n}<br />

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

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

From this, we have:

<br /> 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}}<br />

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

<br /> S\left(x\right) = \frac{A}{1-ax^{-1}}+\frac{B}{1-bx^{-1}}<br />

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

<br /> \frac{1}{1-cx^{-1}}<br />

Are c^n. Therefore, the general form of your sequence is:

<br /> S_n = \frac{2a-c}{a-b}\times a^n + \frac{2b-c}{b-a}\times b^n<br />

Now, from c=a+b and the initial terms, you may deduce the rest.
 
Last edited:
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
Back
Top