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

Answer

$\Sigma^{5}_{k=0}k(k-1)$ =$\Sigma^{6}_{i=1}(i-1)(i-2)$

Work Step by Step

When k = 0, then i = 1. When k = 5, then i = 6. Since i = k + 1, then k = i − 1. Thus, $k(k − 1) = (i − 1)((i − 1) − 1) = (i − 1)(i − 2), $ and so $\Sigma^{5}_{k=0}k(k-1)$ =$\Sigma^{6}_{i=1}(i-1)(i-2)$
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.