Question #117136

Use generating functions to solve the recurrence relation a_k=5a_(k-1)-6a_(k-2) with the initial conditions a_0=6 and a_1=30.

Expert's answer

Given a0=6=6(31−21)a_0=6 = 6(3^1-2^1) and a1=30=6(32−22)a_1=30 = 6(3^2-2^2) .

Also, given the recurrence relation ak=5ak−1−6ak−2a_k=5a_{k-1}-6a_{k-2} .

Hence, a2=5a1−6a0=150−36=114=6(19)=6(33−23)a_2 = 5 a_1 - 6a_0 = 150 - 36 = 114 = 6 (19) = 6(3^3-2^3)

a3=5a2−6a1=5×114−6×30=390=6(65)=6(34−24)a_3 = 5a_2 - 6a_1 = 5 \times 114 - 6\times 30 = 390 = 6(65) = 6(3^4-2^4)

a4=5a3−6a2=5×390−6×114=1266=6(211)=6(35−25)a_4 = 5a_3 - 6a_2 = 5 \times 390 - 6\times 114 = 1266 = 6(211) = 6(3^5-2^5) and so on.

Hence, Generating function is ak=6(3k+1−2k+1)=18×3k−12×2ka_k = 6 (3^{k+1}-2^{k+1})= 18\times 3^k−12 \times 2^k.



LATEST TUTORIALS
APPROVED BY CLIENTS