Algebra 2 (1st Edition)

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

Chapter 12 Sequences and Series - 12.5 Use Recursive Rules with Sequences and Functions - Guided Practice for Examples 3 and 4 - Page 829: 9


$\left\{\begin{array}{l} a_{1}=1,\ a_{2}=2,\\ a_{n}=a_{n-1}\cdot a_{n-2} \end{array}\right.$

Work Step by Step

Note that, starting from the third term (n=3) the current (nth) term equals the product of the preceding two. $ a_1=1,\ \ a_2=2,$ $a_{3}\quad=2=2\times 1\quad=a_{2}\cdot a_{1}=a_{3-1}\cdot a_{3-2}$ $a_{4}\quad=4=2\times 2\quad=a_{3}\cdot a_{2}=a_{4-1}\cdot a_{4-2}$ $a_{5}\quad=8=4\times 2\quad=a_{4}\cdot a_{3}=a_{5-1}\cdot a_{5-2}$ $a_{6}\quad=32=8\times 4\quad=a_{5}\cdot a_{4}=a_{6-1}\cdot a_{6-2}$ From this pattern, $a_{n}=a_{n-1}\cdot a_{n-2}$, for $n\geq 3$. For a recursive rule, we give the information about the first terms and a rule on how to obtain the next term from the preceding ones. Here, $\left\{\begin{array}{l} a_{1}=1,\ a_{2}=2,\\ a_{n}=a_{n-1}\cdot a_{n-2} \end{array}\right.$
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.