Theorem
For any positive integer \(n\), the sum of the first \(n\) cubes is exactly equal to the square of the sum of the first \(n\) integers.
Proof
We prove by induction that \(\displaystyle\sum_{k=1}^{n} k^3 = \left(\frac{n(n+1)}{2}\right)^2\) for all \(n \geq 1\).
Base Case: Let \(n = 1\).
The base case holds.
Inductive Step: We show the statement holds for \(n = m + 1\).
Inductive Hypothesis: Assume the statement holds for \(n = m\), i.e., assume
By the inductive hypothesis
Recognizing \(a^2+2ab+b^2\)
Therefore, by induction, the statement holds for all \(n \geq 1\). ■