For each of the following sequences, if the divergence test applies, either state that limn→∞anlimn→∞an does not exist or find limn→∞an. If the divergence test does not apply, state why.
2. an=n5n2−3
4. an=(2n+1)(n−1)(n+1)2
6. an=2n3n2
8. an=e−2n
10. an=tann
12. an=(1−1n)2n
14. an=(lnn)2√n
State whether the given p -series converges.
16. ∞∑n=11n√n
18. ∞∑n=113√n4
20. ∞∑n=1nπn2e
Use the integral test to determine whether the following sums converge.
22. ∞∑n=113√n+5
24. ∞∑n=1n1+n2
26. ∞∑n=12n1+n4
Express the following sums as p -series and determine whether each converges.
28. ∞∑n=12-lnn (Hint: 2-lnn=1nln2 .)
30. ∞∑n=1n2−2lnn
Use the estimate RN≤∫∞Nf(t)dt to find a bound for the remainder RN=∞∑n=1an−N∑n=1an where an=f(n).
32. 1000∑n=11n2
34. 1000∑n=111+n2
[T] Find the minimum value of N such that the remainder estimate ∫∞N+1f<RN<∫∞Nf guarantees that N∑n=1an estimates ∞∑n=1an, accurate to within the given error.
36. an=1n2, error <10−4
38. an=1n1.01, error <10−4
40. an=11+n2, error <10−3
In the following exercises, find a value of N such that RN is smaller than the desired error. Compute the corresponding sum N∑n=1an and compare it to the given estimate of the infinite series.
42. an=1en, error <10−5, ∞∑n=11en=1e−1=0.581976…
44. an=1n4, error <10−4, ∞∑n=11n4=π490=1.08232...
46. Find the limit as n→∞ of 1n+1n+1+⋯ +12n. (Hint: Compare to ∫2nn1tdt.)
The next few exercises are intended to give a sense of applications in which partial sums of the harmonic series arise.
48. In certain applications of probability, such as the so-called Watterson estimator for predicting mutation rates in population genetics, it is important to have an accurate estimate of the number Hk=(1+12+13+⋯ +1k). Recall that Tk=Hk−lnk is decreasing. Compute T=limk→∞Tk to four decimal places. (Hint: 1k+1<∫k+1k1xdx .)
50. [T] The simplest way to shuffle cards is to take the top card and insert it at a random place in the deck, called top random insertion, and then repeat. We will consider a deck to be randomly shuffled once enough top random insertions have been made that the card originally at the bottom has reached the top and then been randomly inserted. If the deck has n cards, then the probability that the insertion will be below the card initially at the bottom (call this card B) is 1n. Thus the expected number of top random insertions before B is no longer at the bottom is n. Once one card is below B, there are two places below B and the probability that a randomly inserted card will fall below B is 2n. The expected number of top random insertions before this happens is n2. The two cards below B are now in random order. Continuing this way, find a formula for the expected number of top random insertions needed to consider the deck to be randomly shuffled.
52. Show that for the remainder estimate to apply on [N,∞) it is sufficient that f(x) be decreasing on [N,∞), but f need not be decreasing on [1,∞).
54. Does ∞∑n=21n(lnn)p converge if p is large enough? If so, for which p?
56. [T] A fast computer can sum one million terms per second of the divergent series N∑n=21nlnn. Use the integral test to approximate how many seconds it will take to add up enough terms for the partial sum to exceed 100.
Candela Citations
- Calculus Volume 2. Authored by: Gilbert Strang, Edwin (Jed) Herman. Provided by: OpenStax. Located at: https://openstax.org/books/calculus-volume-2/pages/1-introduction. License: CC BY-NC-SA: Attribution-NonCommercial-ShareAlike. License Terms: Access for free at https://openstax.org/books/calculus-volume-2/pages/1-introduction