Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 5 - Sequences, Mathematical Induction, and Recursion - Exercise Set 5.1 - Page 243: 39

Answer

$=\Sigma^{k}_{m=1}(m(m+1))+((n+1)(n+2))$

Work Step by Step

Separating off the final terms $\Sigma^{n+1}_{m=1}=\Sigma^{n}_{m=1}(m(m+1))+(n+1)(n+1+1)$
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.