A Sequence $a _ { 0 } , a _ { 1 } , a _ { 2 } , \ldots$

A sequence $a _ { 0 } , a _ { 1 } , a _ { 2 } , \ldots$ is defined recursively as follows:
$\begin{array} { l } a _ { 0 } = 2 , \quad a _ { 1 } = 9 \\a _ { k } = 5 a _ { k - 1 } - 6 a _ { k - 2 } \text { for all integers } k \geq 2\end{array}$
Use strong mathematical induction to prove that for all integers $$n \geq 0 , a _ { n } = 5 \cdot 3 ^ { n } - 3 \cdot 2 ^ { n }$$

Correct Answer:

Verified

Proof (by strong mathematical induction)...

View Answer

Unlock this answer now
Get Access to more Verified Answers free of charge

View Full Answer For Free