Precalculus (10th Edition)

Published by Pearson
ISBN 10: 0-32197-907-9
ISBN 13: 978-0-32197-907-0

Chapter 12 - Sequences; Induction; the Binomial Theorem - 12.4 Mathematical Induction - 12.4 Assess Your Understanding - Page 830: 1

Answer

Conditions $I$ and $II$ of the principle of mathematical induction both hold therefore $2+4+6+...+2n=n(n+1)$ ifor all natural numbers $n$. Refer to the step-by-step part below for the proof.

Work Step by Step

We are searching for the sum of even numbers. For $n=1$, the given statement true, as $2=1(1+1)$ Thus, $\bf{\text{Condition I}}$ holds. Let us assume that the given satement is true for some natural number $k$, that is, $$2+4+6+...+2k=k(k+1)$$ We need to show that the given statement holds for $k+1$, which is $$2+4+6+...+2k + 2(k+1)=(k+1)[(k+1)+1]=(k+1)(k+2)$$ Using $2+4+6+...+2k=k(k+1)$, we have \begin{align*} 2+4+6+...+2k + 2(k+1)&=(k+1)(k+2)\\ \left(2+4+6+...+2k\right) + 2(k+1)&=(k+1)(k+2)\\ k(k+1)+2(k+1)&=(k+1)(k+2)\\ (k+1)(k+2)&=(k+1)(k+2) &\text{(factored out (k+1) on the left side)} \end{align*} $\bf{\text{Condition II }}$ holds. Thus, the given statement is true for all natural numbers $n$.
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.