30.04.2015 Views

Solução_Calculo_Stewart_6e

Solução_Calculo_Stewart_6e

Solução_Calculo_Stewart_6e

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

F.<br />

458 ¤ CHAPTER 11 INFINITE SEQUENCES AND SERIES<br />

TX.10<br />

63. The terms of a n = n(−1) n alternate in sign, so the sequence is not monotonic. The first five terms are −1, 2, −3, 4,and−5.<br />

Since lim |a n| = lim n = ∞, the sequence is not bounded.<br />

n→∞ n→∞<br />

65. a n = n defines a decreasing sequence since for f(x) =<br />

x<br />

x 2<br />

n 2 +1 x 2 +1 , f 0 +1 (1) − x(2x)<br />

(x) =<br />

(x 2 +1) 2 = 1 − x2<br />

(x 2 +1) 2 ≤ 0<br />

for x ≥ 1. The sequence is bounded since 0 a n and 0 a n ⇒ 1<br />

a n+1<br />

< 1<br />

a n<br />

⇒<br />

− 1<br />

a n+1<br />

> − 1<br />

a n<br />

.Nowa n+2 =3− 1<br />

a n+1<br />

> 3 − 1<br />

a n<br />

= a n+1 ⇔ P n+1 . This proves that {a n } is increasing and bounded<br />

above by 3,so1=a 1 1,soL = 3+√ 5<br />

2<br />

.<br />

71. (a) Let a n be the number of rabbit pairs in the nth month. Clearly a 1 =1=a 2 .Inthenth month, each pair that is<br />

2 or more months old (that is, a n−2 pairs) will produce a new pair to add to the a n−1 pairs already present. Thus,<br />

a n = a n−1 + a n−2 ,sothat{a n } = {f n }, the Fibonacci sequence.<br />

(b) a n = fn+1<br />

⇒ a n−1 = fn fn−1 + fn−2<br />

= =1+ fn−2<br />

1<br />

=1+<br />

=1+ 1 .IfL = lim<br />

f n f n−1 f n−1<br />

f n−1 f n−1 /f n−2 a an,<br />

n−2 n→∞<br />

then L = lim a n−1 and L = lim a n−2,soL must satisfy L =1+ 1<br />

n→∞ n→∞ L ⇒ L2 − L − 1=0 ⇒ L = 1+√ 5<br />

2<br />

[since L must be positive].<br />

n<br />

5<br />

<br />

73. (a) From the graph, it appears that the sequence<br />

n!<br />

n 5<br />

converges to 0,thatis, lim<br />

n→∞ n! =0.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!