Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2011/ia/paper-2/1a/a/solution

Substitution of into the linear recurrence relation gives . Since , division by proves the sequence is a solution exactly when .
For a nonzero triple root of a polynomial , the repeated characteristic root of a linear recurrence rule gives the three independent solutions . One way to see the polynomial factors is to write : the recurrence becomes the third forward difference operator applied to equal to zero, so is a quadratic polynomial. Thus
These three constants give arbitrary initial values , hence the full third-order solution. If , the recurrence instead reduces to : the first three values are arbitrary and every subsequent value is zero. The nonzero-root formula must not be used to discard those initial values.

New to topics? Read the docs here!