Exercise 7.1 — Question 6
To prove a statement P ( n ) by Mathematical Induction, follow three steps:
Base Case: Verify P ( 1 ) (or the initial value) is true.
Inductive Hypothesis: Assume P ( k ) is true for some positive integer k .
Inductive Step: Using the hypothesis, prove P ( k + 1 ) is true.
Conclusion: By the Principle of Mathematical Induction, P ( n ) is true for all positive integers n .
Prove by Mathematical Induction:
1 3 + 2 3 + 3 3 + ⋯ + n 3 = 4 n 2 ( n + 1 ) 2
LHS: 1 3 = 1
RHS: 4 1 2 ⋅ ( 1 + 1 ) 2 = 4 1 ⋅ 4 = 1
Since LHS = RHS = 1 , the statement is true for n = 1 .
Assume the statement is true for n = k , i.e., assume:
1 3 + 2 3 + 3 3 + ⋯ + k 3 = 4 k 2 ( k + 1 ) 2
We need to show:
1 3 + 2 3 + ⋯ + k 3 + ( k + 1 ) 3 = 4 ( k + 1 ) 2 ( k + 2 ) 2
Starting from the LHS:
by hypothesis 1 3 + 2 3 + ⋯ + k 3 + ( k + 1 ) 3 = 4 k 2 ( k + 1 ) 2 + ( k + 1 ) 3
Factor out ( k + 1 ) 2 :
= 4 k 2 ( k + 1 ) 2 + 4 ( k + 1 ) 3
= 4 ( k + 1 ) 2 [ k 2 + 4 ( k + 1 ) ]
= 4 ( k + 1 ) 2 ( k 2 + 4 k + 4 )
= 4 ( k + 1 ) 2 ( k + 2 ) 2
This equals the RHS for n = k + 1 . ✓
Since the statement holds for n = 1 (base case), and whenever it holds for n = k it also holds for n = k + 1 (inductive step), by the Principle of Mathematical Induction the statement is true for all positive integers n .
1 3 + 2 3 + 3 3 + ⋯ + n 3 = 4 n 2 ( n + 1 ) 2