Part of a series of articles about  
Calculus  

 
 
Specialized  
In mathematics, the integral test for convergence is a method used to test infinite series of nonnegative terms for convergence. It was developed by Colin Maclaurin and AugustinLouis Cauchy and is sometimes known as the Maclaurin–Cauchy test.
Contents
Statement of the test[edit]
Consider an integer N and a nonnegative function f defined on the unbounded interval [N, ∞), on which it is monotone decreasing. Then the infinite series
converges to a real number if and only if the improper integral
is finite. In other words, if the integral diverges, then the series diverges as well.
Remark[edit]
If the improper integral is finite, then the proof also gives the lower and upper bounds

(1)
for the infinite series.
Proof[edit]
The proof basically uses the comparison test, comparing the term f(n) with the integral of f over the intervals [n − 1, n) and [n, n + 1), respectively.
Since f is a monotone decreasing function, we know that
and
Hence, for every integer n ≥ N,

(2)
and, for every integer n ≥ N + 1,

(3)
By summation over all n from N to some larger integer M, we get from (2)
and from (3)
Combining these two estimates yields
Letting M tend to infinity, the bounds in (1) and the result follow.
Applications[edit]
The harmonic series
diverges because, using the natural logarithm, its antiderivative, and the fundamental theorem of calculus, we get
Contrary, the series
(cf. Riemann zeta function) converges for every ε > 0, because by the power rule
From (1) we get the upper estimate
which can be compared with some of the particular values of Riemann zeta function.
Borderline between divergence and convergence[edit]
The above examples involving the harmonic series raise the question, whether there are monotone sequences such that f(n) decreases to 0 faster than 1/n but slower than 1/n^{1+ε} in the sense that
for every ε > 0, and whether the corresponding series of the f(n) still diverges. Once such a sequence is found, a similar question can be asked with f(n) taking the role of 1/n, and so on. In this way it is possible to investigate the borderline between divergence and convergence of infinite series.
Using the integral test for convergence, one can show (see below) that, for every natural number k, the series

(4)
still diverges (cf. proof that the sum of the reciprocals of the primes diverges for k = 1) but

(5)
converges for every ε > 0. Here ln_{k} denotes the kfold composition of the natural logarithm defined recursively by
Furthermore, N_{k} denotes the smallest natural number such that the kfold composition is welldefined and ln_{k}(N_{k}) ≥ 1, i.e.
using tetration or Knuth's uparrow notation.
To see the divergence of the series (4) using the integral test, note that by repeated application of the chain rule
hence
To see the convergence of the series (5), note that by the power rule, the chain rule and the above result
hence
and (1) gives bounds for the infinite series in (5).
See also[edit]
 Convergence tests
 Convergence (mathematics)
 Direct comparison test
 Dominated convergence theorem
 EulerMaclaurin formula
 Limit comparison test
 Monotone convergence theorem
References[edit]
 Knopp, Konrad, "Infinite Sequences and Series", Dover Publications, Inc., New York, 1956. (§ 3.3) ISBN 0486601536
 Whittaker, E. T., and Watson, G. N., A Course in Modern Analysis, fourth edition, Cambridge University Press, 1963. (§ 4.43) ISBN 0521588073
 Ferreira, Jaime Campos, Ed Calouste Gulbenkian, 1987, ISBN 9723101793