Question #35762

Find the solution to the recurrence relation a_n=〖-3a〗_(n-1) 〖-3a〗_(n-2) 〖-a〗_(n-3) with initial conditions a_0=1,a_1=-2 and a_2=-1

Expert's answer

We have recurrence relation


an=3an13an2an3a _ {n} = - 3 a _ {n - 1} - 3 a _ {n - 2} - a _ {n - 3}


Characteristic polynomial:


λ3+3λ2+3λ+1=0\lambda^ {3} + 3 \lambda^ {2} + 3 \lambda + 1 = 0(λ+1)3=0(\lambda + 1) ^ {3} = 0λ=1\lambda = - 1


SO we have one root λ=1\lambda = -1 with the 3rd3^{\mathrm{rd}} multiplicity.

So the solution of the relation is


an=(1)n(c1+c2n+c3n2)a _ {n} = (- 1) ^ {n} (c _ {1} + c _ {2} n + c _ {3} n ^ {2})


Substituting initial conditions we get:


a0=c1=1a _ {0} = c _ {1} = 1a1=1(c1+c2+c3)=2a _ {1} = - 1 \left(c _ {1} + c _ {2} + c _ {3}\right) = - 2a2=c1+2c2+4c3=1a _ {2} = c _ {1} + 2 c _ {2} + 4 c _ {3} = - 1


Substituting c1=1c_{1} = 1 into the 2nd2^{\text{nd}} and 3rd3^{\text{rd}} equations we get:


c2+c3=1c _ {2} + c _ {3} = 1c2+2c3=1c _ {2} + 2 c _ {3} = - 1


Solving this system we get:


c1=1c _ {1} = 1c2=3c _ {2} = 3c3=2c _ {3} = - 2


Thus the solution of the recurrence relation is


an=(1)n(1+3n2n2)a _ {n} = (- 1) ^ {n} (1 + 3 n - 2 n ^ {2})

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS