I would like to find the particular solution the following recurrence relation.
$$a_{n}-a_{n-1} = 2(n-1), a_0 = 2$$
By inspection, we would try with $a_n^{(p)} = Bn+C$. When substituting this in the recurrence relation we get
$$Bn+C = B(n-1)+C+2(n-1)$$
and this implies $B=B+2$, which is absurd. What's wrong with this?
Sorry, if this question is answered before.
What's wrong with this?It means that a linear solution doesn't exist. You may try a 2nd degree $A n^2 + B n + C$ polynomial next. Or simply write down the first few terms of the sequence explicitly, and recognize that it's related to a sum of consecutive numbers. – dxiv Sep 15 '16 at 17:07