Consider the recurrence
$$ a_n - 3a_{n-1} + 2a_{n-2} = 6 \cdot 2^n. $$
I tried to solve this as follows. First, I found the homogeneous solution: $$ a_n^{(h)} = r^2 - 3r + 2r \\ (r-2)(r-1) = 0 \\ r = 2,1 \\ a_n^{(h)} = A \cdot 2^n + B $$
While trying to solve for the particular solution (adding $n$ for linear independence), I get an answer which is a false statement: $$ a_n^{(p)} = Cn2^n \\ Cn2^n - 3[C(n-1)2^{n-1}] + 2[C(n-2)2^{n-2}] = 6\cdot 2^n \\ 4Cn - 3[2Cn-2] + 2[Cn-2] = 6 \cdot 2^2 \\ 4Cn - 6Cn + 6 + 2Cn - 4 = 24 \\ 0Cn+2 = 24 \\ 0Cn = 22 $$
Iām not sure where the issue lies. Am I performing the problem incorrectly, or does the problem have an issue?