College Algebra (6th Edition)

Published by Pearson
ISBN 10: 0-32178-228-3
ISBN 13: 978-0-32178-228-1

Chapter 8 - Sequences, Induction, and Probability - Exercise Set 8.2 - Page 724: 10


$-7, -3, 1, 5, 9, 13$

Work Step by Step

Using recursion formula we will plug n=2 into equation: $a_{2}=a_{1}+4$ . If we get to know first term then we can find second term and so we will find up to 6 terms.
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.