Problem Set: The Divergence and Integral Tests

For each of the following sequences, if the divergence test applies, either state that limnanlimnan does not exist or find limnan. If the divergence test does not apply, state why.

1. an=nn+2

2. an=n5n23

3. an=n3n2+2n+1

4. an=(2n+1)(n1)(n+1)2

5. an=(2n+1)2n(3n2+1)n

6. an=2n3n2

7. an=2n+3n10n2

8. an=e2n

9. an=cosn

10. an=tann

11. an=1cos2(1n)sin2(2n)

12. an=(11n)2n

13. an=lnnn

14. an=(lnn)2n

State whether the given p -series converges.

15. n=11n

16. n=11nn

17. n=113n2

18. n=113n4

19. n=1nenπ

20. n=1nπn2e

Use the integral test to determine whether the following sums converge.

21. n=11n+5

22. n=113n+5

23. n=21nlnn

24. n=1n1+n2

25. n=1en1+e2n

26. n=12n1+n4

27. n=21nln2n

Express the following sums as p -series and determine whether each converges.

28. n=12-lnn (Hint: 2-lnn=1nln2 .)

29. n=13-lnn (Hint: 3-lnn=1nln3 .)

30. n=1n22lnn

31. n=1n32lnn

Use the estimate RNNf(t)dt to find a bound for the remainder RN=n=1anNn=1an where an=f(n).

32. 1000n=11n2

33. 1000n=11n3

34. 1000n=111+n2

35. 100n=1n2n

[T] Find the minimum value of N such that the remainder estimate N+1f<RN<Nf guarantees that Nn=1an estimates n=1an, accurate to within the given error.

36. an=1n2, error <104

37. an=1n1.1, error <104

38. an=1n1.01, error <104

39. an=1nln2n, error <103

40. an=11+n2, error <103

In the following exercises, find a value of N such that RN is smaller than the desired error. Compute the corresponding sum Nn=1an and compare it to the given estimate of the infinite series.

41. an=1n11, error <104, n=11n11=1.000494 

42. an=1en, error <105, n=11en=1e1=0.581976 

43. an=1en2, error <105, n=1nen2=0.40488139857 

44. an=1n4, error <104, n=11n4=π490=1.08232...

45. an=1n6, error <106, n=11n4=π6945=1.01734306...,

46. Find the limit as n of 1n+1n+1+ +12n. (Hint: Compare to 2nn1tdt.)

47. Find the limit as n of 1n+1n+1+ +13n

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=Hklnk is decreasing. Compute T=limkTk to four decimal places. (Hint: 1k+1<k+1k1xdx .)

49. [T] Complete sampling with replacement, sometimes called the coupon collector’s problem, is phrased as follows: Suppose you have N unique items in a bin. At each step, an item is chosen at random, identified, and put back in the bin. The problem asks what is the expected number of steps E(N) that it takes to draw each unique item at least once. It turns out that E(N)=N.HN=N(1+12+13+ +1N). Find E(N) for N=10,20,and 50.

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.

51. Suppose a scooter can travel 100 km on a full tank of fuel. Assuming that fuel can be transferred from one scooter to another but can only be carried in the tank, present a procedure that will enable one of the scooters to travel 100HN km, where HN=1+12+ +1N.

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,).

53. [T] Use the remainder estimate and integration by parts to approximate n=1nen within an error smaller than 0.0001.

54. Does n=21n(lnn)p converge if p is large enough? If so, for which p?

55. [T] Suppose a computer can sum one million terms per second of the divergent series Nn=11n. Use the integral test to approximate how many seconds it will take to add up enough terms for the partial sum to exceed 100.

56. [T] A fast computer can sum one million terms per second of the divergent series Nn=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.