<< Chapter < Page Chapter >> Page >

n = 1 n π n 2 e

Series converges, p = 2 e π > 1 .

Got questions? Get instant answers now!

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

n = 1 1 n + 5 3

Series diverges by comparison with 1 d x ( x + 5 ) 1 / 3 .

Got questions? Get instant answers now!

n = 1 n 1 + n 2

Series diverges by comparison with 1 x 1 + x 2 d x .

Got questions? Get instant answers now!

n = 1 e n 1 + e 2 n

Got questions? Get instant answers now!

n = 1 2 n 1 + n 4

Series converges by comparison with 1 2 x 1 + x 4 d x .

Got questions? Get instant answers now!

n = 2 1 n ln 2 n

Got questions? Get instant answers now!

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

n = 1 2 ln n ( Hint: 2 ln n = 1 / n ln 2 .)

2 ln n = 1 / n ln 2 . Since ln 2 < 1 , diverges by p -series.

Got questions? Get instant answers now!

n = 1 3 ln n ( Hint: 3 ln n = 1 / n ln 3 .)

Got questions? Get instant answers now!

n = 1 n 2 −2 ln n

2 −2 ln n = 1 / n 2 ln 2 . Since 2 ln 2 1 < 1 , diverges by p -series.

Got questions? Get instant answers now!

n = 1 n 3 −2 ln n

Got questions? Get instant answers now!

Use the estimate R N N f ( t ) d t to find a bound for the remainder R N = n = 1 a n n = 1 N a n where a n = f ( n ) .

n = 1 1000 1 n 2

R 1000 1000 d t t 2 = 1 t | 1000 = 0.001

Got questions? Get instant answers now!

n = 1 1000 1 1 + n 2

R 1000 1000 d t 1 + t 2 = tan −1 tan −1 ( 1000 ) = π / 2 tan −1 ( 1000 ) 0.000999

Got questions? Get instant answers now!

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

a n = 1 n 2 , error < 10 −4

R N < N d x x 2 = 1 / N , N > 10 4

Got questions? Get instant answers now!

a n = 1 n 1.1 , error < 10 −4

Got questions? Get instant answers now!

a n = 1 n 1.01 , error < 10 −4

R N < N d x x 1.01 = 100 N −0.01 , N > 10 600

Got questions? Get instant answers now!

a n = 1 n ln 2 n , error < 10 −3

Got questions? Get instant answers now!

a n = 1 1 + n 2 , error < 10 −3

R N < N d x 1 + x 2 = π / 2 tan −1 ( N ) , N > tan ( π / 2 10 −3 ) 1000

Got questions? Get instant answers now!

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

a n = 1 n 11 , error < 10 −4 , n = 1 1 n 11 = 1.000494

Got questions? Get instant answers now!

a n = 1 e n , error < 10 −5 , n = 1 1 e n = 1 e 1 = 0.581976

R N < N d x e x = e N , N > 5 ln ( 10 ) , okay if N = 12 ; n = 1 12 e n = 0.581973... . Estimate agrees with 1 / ( e 1 ) to five decimal places.

Got questions? Get instant answers now!

a n = 1 e n 2 , error < 10 −5 , n = 1 n / e n 2 = 0.40488139857

Got questions? Get instant answers now!

a n = 1 / n 4 , error < 10 −4 , n = 1 1 / n 4 = π 4 / 90 = 1.08232 ...

R N < N d x / x 4 = 4 / N 3 , N > ( 4.10 4 ) 1 / 3 , okay if N = 35 ;

n = 1 35 1 / n 4 = 1.08231 . Estimate agrees with the sum to four decimal places.

Got questions? Get instant answers now!

a n = 1 / n 6 , error < 10 −6 , n = 1 1 / n 4 = π 6 / 945 = 1.01734306... ,

Got questions? Get instant answers now!

Find the limit as n of 1 n + 1 n + 1 + + 1 2 n . ( Hint: Compare to n 2 n 1 t d t . )

ln ( 2 )

Got questions? Get instant answers now!

Find the limit as n of 1 n + 1 n + 1 + + 1 3 n

Got questions? Get instant answers now!

The next few exercises are intended to give a sense of applications in which partial sums of the harmonic series arise.

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 H k = ( 1 + 1 2 + 1 3 + + 1 k ) . Recall that T k = H k ln k is decreasing. Compute T = lim k T k to four decimal places. ( Hint: 1 k + 1 < k k + 1 1 x d x .)

T = 0.5772 ...

Got questions? Get instant answers now!

[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 . H N = N ( 1 + 1 2 + 1 3 + + 1 N ) . Find E ( N ) for N = 10 , 20 , and 50 .

Got questions? Get instant answers now!

[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 1 / n . 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 2 / n . The expected number of top random insertions before this happens is n / 2 . 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.

The expected number of random insertions to get B to the top is n + n / 2 + n / 3 + + n / ( n 1 ) . Then one more insertion puts B back in at random. Thus, the expected number of shuffles to randomize the deck is n ( 1 + 1 / 2 + + 1 / n ) .

Got questions? Get instant answers now!

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 100 H N km, where H N = 1 + 1 / 2 + + 1 / N .

Got questions? Get instant answers now!

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

Set b n = a n + N and g ( t ) = f ( t + N ) such that f is decreasing on [ t , ) .

Got questions? Get instant answers now!

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

Got questions? Get instant answers now!

Does n = 2 1 n ( ln n ) p converge if p is large enough? If so, for which p ?

The series converges for p > 1 by integral test using change of variable.

Got questions? Get instant answers now!

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

Got questions? Get instant answers now!

[T] A fast computer can sum one million terms per second of the divergent series n = 2 N 1 n ln n . Use the integral test to approximate how many seconds it will take to add up enough terms for the partial sum to exceed 100 .

N = e e 100 e 10 43 terms are needed.

Got questions? Get instant answers now!
Practice Key Terms 4

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Calculus volume 2. OpenStax CNX. Feb 05, 2016 Download for free at http://cnx.org/content/col11965/1.2
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Calculus volume 2' conversation and receive update notifications?

Ask