I have a problem that is supposed to use induction, but I have no idea how to solve it. Could I get some help?
The closed form sum of
12 $\left[ 1^2 \cdot 2 + 2^2 \cdot 3 + \ldots + n^2 (n+1) \right]$ for $n \geq 1$ is $n(n+1)(n+2)(an+b)$. Find an + b.
For determining $a$ and $b$ it's sufficient to use two values of $n$, say $n=1$ and $n=2$. Then verifying the conjecture, that is $$ 12\bigl(1^2\cdot 2+2^2\cdot 3+\dots+n^2(n+1)\bigr)=n(n+1)(n+2)(an+b) $$ for all $n\ge 1$ (where $a$ and $b$ are those determined before) requires induction. You already have the base case ($n=1$), so you can write \begin{multline} 12\bigl(1^2\cdot 2+2^2\cdot 3+\dots+n^2(n+1)+(n+1)^2(n+2)\bigr)\\ =n(n+1)(n+2)(an+b) +12(n+1)^2(n+2) \end{multline} and go on from here to obtain the expression $$ (n+1)(n+2)(n+3)(an+a+b) $$