Precalculus: Concepts Through Functions, A Unit Circle Approach to Trigonometry (3rd Edition)

Published by Pearson
ISBN 10: 0-32193-104-1
ISBN 13: 978-0-32193-104-7

Chapter 11 - Sequences; Induction; the Binomial Theorem - Section 11.4 Mathematical Induction - 11.4 Assess Your Understanding - Page 850: 16


Since the given statement for $n=1$, and that when assumed to be true for a natural number k, the given statement is also true for $n=k+1$, then by the principle of Mathematical Induction, the given statement is true for all natural numbers $n$. (Refer to the step-by-step work below for the actual proof) Thus, for all natural numbers $n$, $−2−3−4....…−(n+1)=−\dfrac{1}{2}n(n+3)$

Work Step by Step

In order to prove the given statement, we will use the following two conditions for mathematical induction. a) The statement must hold for the first natural number, known as the base case. b) Assume that the statement is true for some arbitrary natural number $n$ larger than the first natural number, then we will prove that the statement also holds for $n + 1$. This is known as the inductive step. So, we have: a) For $n=1$: $-2=-0.5(1)(1+3)=-2$ b) Assume for $n=k $ : $−2−3−…−(k+1)=−0.5k(k+3)$ Then for $n=k+1$: $−2−3−…−(k+1)−(k+2)=−0.5k(k+3)−(k+2)\\ =−0.5k^2−1.5k−k−2 \\ =−0.5(k+1)(k+4)\\=−0.5(k+1)[(k+3)+1]$ Thus, we can see that the above two conditions are satisfied. So, by the Principal of Mathematical Induction, the given statement has been proved true for all natural numbers.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.