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.1 - Page 716: 76


please see step-by-step

Work Step by Step

A recursion formula defines how to obtain the next term if we know the preceding term(s). So, instead of defining the terms as a function of n, they are defined as a function of previous term(s). The form is $a_{n+1}=$( expression involving $a_{1},...,a_{n})$ Example: $\left\{\begin{array}{ll} a_{1}=3 & \\ a_{n+1}=a_{n}+2, & n \geq 1 \end{array}\right.$ defines a sequence with terms $a_{1}=3$ $a_{2}=3+2=5$ $a_{3}=5+2=7$ $... etc$ 3, 5, 7, 9,... The above sequence can be defined as as a function of n by defining the general term with $a_{n}=2n+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.