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: 30

Answer

$1\times(1+1)+2\times(2+1)+3\times(3+1)+...+n\times(n+1)$

Work Step by Step

Starting with i=1, use n to compute the first few terms. Since we do not know what n is we make use of "..." so show that the same pattern is continued with the next j's until j=n, where it ends. $1\times(1+1)+2\times(2+1)+3\times(3+1)+...+n\times(n+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.