Generating function of a recurrance relation

jrp131191
Messages
17
Reaction score
0
Suppose A(x) is a generating function for the sequence a0, a1, a2, . . . that satisfies
the recurrence a[n+2] = −a[n+1] + 6a[n] for n > 0, with initial conditions a[0] = 2 and
a[1] = −1. Find a formula for A(x) and use it to find an explicit formula for a[n].

I don't know what I am doing wrong, here is what I have done..
the first few terms of this sequence are 2,-1,13,-19,97,-211
my taylor series expansion is .. 1 + x + 5 x^2 + x^3 + 29x^4 which is wrong..

______________________________________…

a[n+2] = −a[n+1] + 6a[n]

all summations for n_> 0

∑ a[n+2] = -∑a[n+1] + 6∑a[n]

∑ a[n+2]x^n = -∑a[n+1]x^n + 6∑a[n]x^n

(1/x^2)∑ a[n+2]x^(n+2) = -(1/x)∑a[n+1]x^(n+1) + 6∑a[n]x^n

A(x) = ∑a[n]x^n

=> (1/x^2)(A(x) - a[0] - a[1]) = -(1/x)(A(x) - a[0]) + 6A(x)

A(x) - a[0] - a[1] = -x(A(x) - a[0]) + 6x^2A(x)

A(x)-2+1 = -xA(x) + 2x + 6x^2A(x)

A(x) +xA(x) - 6x^2A(x) = 2x + 1

A(x)(1+x-6x^2) = 2x+1

A(x) = (2x+1)/(1+x-6x^2)

and this functions series expansion does not have the right coefficients as mentioned before.. i really can't see where I've gone wrong..

help please :(
 
Physics news on Phys.org
jrp131191 said:
A(x)(1+x-6x^2) = 2x+1

A(x) (1 + x - 6x^2) = 2x - 1
 
jrp131191 said:
(1/x^2)∑ a[n+2]x^(n+2) = -(1/x)∑a[n+1]x^(n+1) + 6∑a[n]x^n

A(x) = ∑a[n]x^n

=> (1/x^2)(A(x) - a[0] - a[1]) = -(1/x)(A(x) - a[0]) + 6A(x)

an x is missing from one of the terms above
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top