You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Section 8.1 Sequences 443<br />
56. Fibonacci Sequence The Fibonacci Sequence can be<br />
defined recursively by a 1 1, a 2 1, and a n a n2 a n1 for<br />
all integers n 3.<br />
(a) Write out the first 10 terms of the sequence.<br />
1, 1, 2, 3, 5, 8, 13, 21, 34, 55<br />
(b) Draw a graph of the sequence using the Sequence Graphing<br />
mode on your grapher. Enter u(n) u(n 1) u(n 2) and<br />
u(nMin) {1, 1}.<br />
Extending the Ideas<br />
57. Writing to Learn If {a n } is a geometric sequence with all<br />
positive terms, explain why {log a n } must be arithmetic.<br />
58. Writing to Learn If {a n } is an arithmetic sequence, explain<br />
why {10 a n} must be geometric.<br />
59. Proving Limits Use the formal definition of limit to prove that<br />
lim 1 n→ n 0.<br />
1. 12, 23, 34, 45, 56, 67; 5051<br />
2. 2, 52, 83, 114, 145, 176; 149/50<br />
3. 2, 94, 6427, 625256, 77763125 2.48832,<br />
11764946656 2.521626; (5150) 50 2.691588<br />
11. (a) 3 (b) 19<br />
(c) a n a n1 3 (d) a n 3n 5<br />
12. (a) –2 (b) 1<br />
(c) a n a n1 2 (d) a n 2n 17<br />
13. (a) 1/2 (b) 92<br />
(c) a n a n1 12 (d) a n (n 1)2<br />
14. (a) 0.1 (b) 3.7<br />
(c) a n a n1 0.1 (d) a n 0.1n 2.9<br />
15. (a) 12 (b) 8(12) 8 0.03125<br />
(c) a n (12)a n1<br />
(d) a n 8(12) n1 2 4n<br />
16. (a) 1.5 (b) (1)(1.5) 8 25.6289<br />
(c) a n (1.5)a n1<br />
(d) a n (1)(1.5) n1 (1.5) n1<br />
17. (a) –3 (b) (3) 9 19,683<br />
(c) a n (3)a n1<br />
(d) a n (3)(3) n1 (3) n<br />
18. (a) –1 (b) (5)(1) 8 5<br />
(c) a n a n1<br />
(d) a n 5(1) n1<br />
57. a n ar n1 implies that log a n log a (n 1) log r. Thus {log a n } is<br />
an arithmetic sequence with first term log a and common ratio log r.<br />
58. a n a (n 1)d implies that 10 a n 10 a(n1)d 10 a (10 d ) n1 . Thus<br />
{10 a n } is a geometric sequence with first term 10 a and common ratio 10 d .<br />
59. Given e 0 choose M 1e. Then 1 n 0 e if n M.