Standard +0.8 This question requires students to substitute the general solution into the recurrence relation and equate coefficients of powers of n and the constant term. While the algebraic manipulation is straightforward, it demands careful systematic work with multiple terms (exponential and polynomial) and solving a system to find four unknowns. It's above average difficulty due to the reverse-engineering nature and need for methodical coefficient comparison, but remains accessible to well-prepared Further Maths students.
2. The general solution of the first order recurrence relation
$$u _ { n + 1 } + a u _ { n } = b n ^ { 2 } + c n + d \quad n \geqslant 0$$
is given by
$$u _ { n } = A ( 3 ) ^ { n } + 5 n ^ { 2 } + 1$$
where \(A\) is an arbitrary non-zero constant.
By considering expressions for \(u _ { n + 1 }\) and \(u _ { n }\), find the values of the constants \(a , b , c\) and \(d\).
2. The general solution of the first order recurrence relation
$$u _ { n + 1 } + a u _ { n } = b n ^ { 2 } + c n + d \quad n \geqslant 0$$
is given by
$$u _ { n } = A ( 3 ) ^ { n } + 5 n ^ { 2 } + 1$$
where $A$ is an arbitrary non-zero constant.\\
By considering expressions for $u _ { n + 1 }$ and $u _ { n }$, find the values of the constants $a , b , c$ and $d$.\\
\hfill \mbox{\textit{Edexcel FD2 2024 Q2 [3]}}