I am having hard times figuring out this problem: Solve the recurrence relation using generating functions: $\displaystyle a_{n}=3a_{n-1}-4n $ $\displaystyle n\ge 1 , a_{0}=2 $ Thanks, John
Follow Math Help Forum on Facebook and Google+
Substitute the recursive relation in the generating function to get a function equation of the generating function. solve the equation to get generating function, and expand it to get a_n.
View Tag Cloud