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.1 Sequences - 11.1 Assess Your Understanding - Page 828: 77

Answer

$3570$

Work Step by Step

Recall the formulas: $\displaystyle \sum_{k=1}^{n} (ca_k)=c \ \sum_{k=1}^{n} a_k$ and $ \displaystyle \sum_{k=1}^{n} k=\dfrac{n(n+1)}{2}$ We can see that for the given sequence, the index does not start at 1. So, we will re-write the given sequence as: $\sum_{k=10}^{60} (2k)=$ (Terms from 10 to 60) = (Terms from 1 to 60) - (Terms from 1 to 9) We rewrite the sequence as stated above and apply the sum formulas: $\displaystyle \sum_{k=10}^{60} (2k)= \sum_{k=1}^{60} (2k) -\sum_{k=1}^{9} (2k) \\= (2) \sum_{k=1}^{60} k - (2) \sum_{k=1}^{9} k \\= 2 [ \displaystyle \dfrac{60(60+1)}{2} -\dfrac{9(9+1)}{2}] \\=2 (1830 -45) \\= 3570$
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.