(a) For this problem, fill in the mathematical steps in a proof by induction. The goal is to prove that the following formula is true for all n ≥ 2:
1(2) + 2(3) + 3(4) + ... + (n-1)n = n(n-1)(n+1) / 3
(b) Let P(n) be the formula given above. First, prove the basis step by showing that P(2) is true:
(c) We will now attempt to prove the inductive step. Start by writing down an equation that represents what it means for P(k+1) to be true (goal):
(d) Prove that P(k+1) is true below, i.e. start with the left side of P(k+1) and use the inductive hypothesis and algebra to show it is equal to the right side: