For a positive integer \(n\), simplify
\(T_n=\sum_{k=1}^{n}(k+2)^2-\sum_{k=1}^{n}k^2\)
without expanding all \(n\) terms or using a formula for \(\sum k^2\). Use a change of index to expose cancellation, and give the final result as a polynomial in \(n\).
Hints
- Reindex the first sum so that its squared terms are written with the same index pattern as the second sum.
- Compare the two resulting ranges and identify which middle terms occur in both.
- Keep the unmatched terms at the two ends before simplifying algebraically.
Solution
1. In the first sum, let \(j=k+2\). Then
\(\sum_{k=1}^{n}(k+2)^2=\sum_{j=3}^{n+2}j^2\).
2. Therefore
\(T_n=\sum_{j=3}^{n+2}j^2-\sum_{k=1}^{n}k^2\).
The terms \(3^2,4^2,\ldots,n^2\) cancel when they are present; the endpoint expression that remains is
\(T_n=(n+1)^2+(n+2)^2-1^2-2^2\).
This endpoint identity also holds for \(n=1\) and \(n=2\), where the overlap is shorter.
3. Simplifying gives
\(T_n=2n^2+6n\).
Answer
\(T_n=2n^2+6n\).