Use mathematical induction to prove that 1 + 2 + 3 + … + n = n(n + 1)/2 for all integers n ≥ 1.
Show answerJawab dekhein
Basis (n = 1): 1 = 1(2)/2. True. Inductive step: assume 1 + 2 + … + k = k(k + 1)/2. Then 1 + 2 + … + k + (k + 1) = k(k + 1)/2 + (k + 1) = (k + 1)(k + 2)/2, which is the formula for k + 1. Hence it holds for all n ≥ 1.