Exercises on series
Test the following series
If a chessboard were to have wheat placed upon each square such that one grain were placed on the first square, two on the second, four on the third, and so on (doubling the number of grains on each subsequent square), how many grains of wheat would be on the chessboard at the finish?
Solutions
The number of grains of wheat on the square,
1, 2, 4, 8, 16, 32, 64, 128, 256 ...
form a geometric sequence, which grows at an increasing rate. Its sum can be obtained as
where a is the first term of the series, q is the common ratio and n is the number of terms. Doing the calculations we have then 264 − 1. This ■
Note that the general term an ~ 1/n2, hence the series diverges. ■
ln n/n > 1/n then it diverges. ■
We study separately the behaviour of each series:
Σ (−1/5)n
is a geometric series with common ration −1/5, hence it converges. The second series is a generalized harmonic series with α = 1/2, hence it converges. ■
The series is asymptotic to the harmonic series, hence it diverges.
(n + e−n)/(3n2 + 5) ~ 1/3 ⋅ 1/n ■
The series converves being asymptotic to the series Σn=1 1/n3 ⋅ 1/√n. Indeed we have
(ln n −√n)/(3n4 − 1) ~ √n/3n4 = −1/3 ⋅ 1/(n3 √n) ■
It converges. We can use the ratio test whihc yields
an+1/an = (n + 1)100/en + 1 = en/n100 = 1/e ⋅ [(n + 1)/n]100 ⟶ 1/e < 1 ■
It is an alternating series. We use the criterion of absolute convergence and study Σ |cos n|/n3 and since |cos n| ≤ 1 we have that the series is a minorant of Σ 1/n3 which we known to converge. Thus the series converges. ■
We apply the ratio test
We have that (n + 1)n + 1 = (n + 1) ⋅ (n + 1)n and by the definition of factorial (n + 1)! = n! ⋅ (n + 1), then the limit is equal to
thus the series converges. ■
Since n1/n < n, we compare with the series Σ n/n!, which converges. ■
We use the Leibniz Criterion. We've that
and
hence the series converges. ■