Of all the tests you have seen do far and will see later, these are the trickiest to use because
you have to have some idea of what it is you are trying to prove. If a series is divergent and you
erroneously believe it is convergent, then applying these tests will lead only to extreme
frustration. But there are some pointers that you can use in order to apply them successfully.
This is intuitively clear; let us look at the convergence case where we have a series
which satisfies and where we know that converges. Then the situation
with the partial sums, which from a monotonic increasing sequence, is this:
Where refers to the partial sums of the series and to that of Being this the
case, it follows (not immediately obvious but intuitive) that:
Thus, if , exists and so must . A similar argument can be used
for the divergence case.
In order to apply this test to a given series we must have a feeling as to whether it
converges or diverges. If we feel it converges, then we need to come up with a sequence
whose terms bound from above ( and whose corresponding
sum .
If, on the other hand, we feel that the give series diverges, then we need to come up with a
sequence whose terms bound from below and whose corresponding sum
How do we get this feeling? With practice and through the intuition that practice gives us. But
there are some pointers you can follow.
Ask: what does look like for large n? We will use the symbol to mean that for large
n the terms are of the same order of magnitude or behave more or less the same way. Thus,
Solution
We begin by factoring the largest power of n in order to determine what looks like
for large n:
Thus, for large n
We need to make the fraction smaller. We can achieve this by making its
numerator smaller and/or its denominator larger. Not much we can do with the
numerator, but we know this:
Thus,
or
Solution
Once again, factoring the largest power of n in order to determine what looks like
for large n:
and such that is known to converge. So now we have to make our fraction larger.
How do we do this? We make the numerator larger and/or the denominator smaller.
Thus,
Solution
The operational thing to observe here is that for which can be seen from the
graph below:
and we expect convergence. Thus, we seek to bound from above and the choice is
clear in light of the inequality :
Solution
We need to get an idea of how behaves in terms of the series which we know
to converge or diverge. Using the inequality we can write
But this does not help because although we know diverges (why?) we still
Our next comparison test is a little more mechanical in nature and it is called the Limit
Comparison Test:
series. Of course we must know the behavior of , but we can always default to the know
Solution
Here which we suspect converges because it has the form for large
n. thus, let
and compute
Simplifying,
Since both series do the same thing. Since converges, so
does .
Solution
Solution
Let us apply the limit comp test blindly; let be our comparing sequence and let
us see what limit we get:
This is case III of our result: If and diverges, so does .
Solution
You might be tempted to think that this is case II of our theorem but it is not; the limit is
0, but does not converge. Thus, nothing can be concluded; we should have used
a different comparing sequence.
Let us try :
This is case II: If and converges, so does .
Solution
This series involves the all important which we will encounter time and time again.
Here,
Clearly this is a case of but one in which we cannot use l’Hopital’s rule. How do we
proceed? We use the definition of :
The table below shows how the numerator and denominator behave:
n-values 10^n n!
1 10 1
2 100 2
3 1000 6
4 10000 24
5 100000 120
6 1000000 720
You can see how much quicker grows and it is tempting to conclude
n-Values 2^n n!
1 2 1
2 4 2
3 8 6
4 16 24
It looks totally the opposite of 5the first table!
32
This is why in math we cannot use
120
arguments based on observations; 6 if we make
64 an assertion,
720 we must prove it and what
we want to prove here is that, in 7fact, 128 5040
Once we have done this, we will prove that converges by either comparison
test.
Exercise: show .
.
.
.
By the time we get to the 5th term you can see that
and you can verify that
Now we reproduce the argument for . Once , we will have the following
situation:
Now we can argue in the same way as the previous case and write:
n – 9 terms