Algebra 2 (1st Edition)

Published by McDougal Littell
ISBN 10: 0618595414
ISBN 13: 978-0-61859-541-9

Chapter 12 Sequences and Series - 12.1 Define and Use Sequences and Series - 12.1 Exercises - Skill Practice - Page 799: 59


True. (see proof below)

Work Step by Step

$\displaystyle \sum_{i=1}^{n}ka_{i}=ka_{1}+ka_{2}+ka_{3}+ka_{4}+\cdots+ka_{n}$ ... we can factor k out, $=k(a_{1}+a_{2}+a_{3}+\cdots+a_{n})$ ... and recognize the sum in the parentheses can be written in summation notation, The lower limit is 1, and the upper limit is n. $=k\displaystyle \cdot\sum_{i=1}^{n}a_{i}$ The statement is true.
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.