An infinite sequence is a list of numbers. The following examples should make the idea clear.
Example. Here is a familiar sequence:
Sequences are often written using subscript notation. This one might be written
The a is just a dummy variable. The subscript n is the important thing, since it keeps track of the number of the term and also occurs in the formula .
You can also write .
There is no reason why you have to start indexing at 0. Here is the same sequence, indexed from 1:
The picture below shows a plot of the first few terms of the sequence using n on the horizontal axis and the value of the sequence on the vertical axis. That is, I plotted the points
To make it look like an ordinary graph, I connected the dots with segments, but you can also plot the points by themselves.
Example. The order of the numbers in a sequence is important:
are different sequences.
Example. ( Arithmetic sequences) These are sequences like
In an arithmetic sequence, you get the next term by adding a fixed number to the preceding term.
Example. ( Geometric sequences) Another way to generate a sequence of numbers is to multiply the last number by a fixed number. For example,
By experimenting, you can see that the terms in a geometric sequence can do the following things:
Here are the rules. If your sequence is , then:
I'm being a bit informal in our use of "converges" and "diverges". I'll explain in more detail in the next example.
Example. Here is a geometric sequence in which each term is times the previous term:
The terms appear to approach 0, so it's natural to write .
Here is a picture of the terms in this sequence.
Notice that the rectangles' heights approach 0.
Here is a geometric sequence in which each term is times the previous term:
The terms appear to increase indefinitely, so I'll write .
Here is an interesting way to picture of the terms in this sequence. Take a segment and divide it into thirds. Replace the middle third with a "bump" shaped like an equilateral triangle.
If the original segment had length 1, the new path with the triangular bump has length .
Now repeat the process with each of the four segments:
Since each segment's length is multiplied by , this path has total length .
Here's the result of repeating the process two more times:
If you continue this process indefinitely, the limiting path must have infinite length, since . The limiting path is an example of a self-similar fractal.
One of the most important questions you can ask about a sequence is: What do the terms do as n gets large?
If is a sequence, then
means that you can make the terms as close to L as you please by making n sufficiently large.
If exists, the sequence converges; if does not exist, the sequence diverges.
If a sequence diverges, but the terms either increase or decrease indefinitely, then you write
Thus, means that you can make the terms as large (and positive) as you want by making n sufficiently large. A similar definition applies for .
With this definition, all the ordinary rules for computing limits apply.
Theorem. Suppose , , and are sequences. Then:
(a) , where k is a constant.
(b) .
(c) .
(d) , provided that .
(e) ( Squeezing Theorem) If for all n, and and , then .
As usual, in parts (b), (c), and (d) the interpretation is that the two sides of an equation are equal when all the limits involved are defined.
Besides the rules above, you may also use L'Hopital's Rule to compute limits of sequences.
Example. Determine whether the sequence
converges or diverges. If it converges, find the limit.
Hence, the series converges.
Example. Determine whether the sequence
converges or diverges. If it converges, find the limit.
Divide the top and bottom by :
Now , and this goes to 0 because . Clearly and go to 0. The limit reduces to
The sequence converges to 0.
Example. (a) Determine whether the sequence
converges or diverges. If it converges, find the limit.
Since , I have
Now
By the Squeezing Theorem,
(b) Determine whether the sequence
converges or diverges. If it converges, find the limit.
Note that
Hence, when n is large and even, is close to 1, and when n is large and odd, is close to -1. Therefore, the sequence diverges by oscillation.
Example. Determine whether the sequence
converges or diverges. If it converges, find the limit.
Note that
(The " " comes from the fact that squares can't be negative.) Divide by n:
Now and , so
by the Squeezing Theorem. The sequence converges to 0.
Example. Here is a sequence defined by recursion:
Here are the first few terms:
Assume that exists. What is it?
Let . Then
So
(I'm assuming that it's justified to move the limit inside the square root to get the second equality, just as it would be for limits of functions.)
Now it is easy to solve for L:
Since , .
Example. Start with a positive integer. If it is even, divide it by 2. If it is odd, multiply by 3 and add 1. Continue forever. You obtain a sequence of numbers --- a different sequence for each number you start with.
Here are the first 20 terms of the sequence which starts with 23:
{23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1, 4, 2, 1, 4, 2}
If you try other starting numbers, you'll find that you always seem to get stuck in the loop. The Collatz conjecture says that this always happens. It is known to be true for starting numbers (at least) up to .
A sequence
You can treat the terms of a sequence as values of a continuous function and use the first derivative to determine whether a sequence increases or decreases.
Example. Determine whether the sequence given by increases, decreases, or does neither.
Set . Then
Since for all x, the sequence increases.
In some cases, it's not possible to use the derivative to determine whether a sequence increases or decreases. Here's another approach that is often useful:
Here is a rough justification for this rule. Suppose . For large values of n, I have
The last inequality says that the next term ( ) is less than the current term ( ), which means that the terms decrease. Similar reasoning applies if .
(The reason I have to say the terms eventually decrease or increase is that the limit tells what the sequence does for large values of n. For small values of n, the sequence may increase or decrease, and this behavior won't be detected by taking the limit.)
Example. Determine whether the sequence given by increases, decreases, or does neither.
I compute :
Since is limit is less than 1, the terms of the sequence eventually decrease.
A sequence is bounded if there is a number M such that for all n.
Pictorially, this means that all of the terms of the sequence lie between the lines and :
I can also say a sequence is bounded if there are numbers C and D such that for all n. This definition is equivalent to the first definition. For if a sequence satisfies for all n, then for all n (so I can take and in the second definition). On the other hand, if for all n, then , where is the larger of the numbers and (so I can take in the first definition).
Example. Prove that the sequence is bounded.
Since ,
Thus, the sequence is bounded according to the second definition. Also, , and hence . Therefore, the sequence is bounded according to the first definition.
Here's another way of telling that a sequence is bounded:
To see this, suppose that . By definition, this means that I can make as close to L as I want by making n large enough. Suppose, for instance, I know that is within 0.1 of L once n is greater than some number p. (I picked the number 0.1 at random.) Thus, all the terms after are within 0.1 of L:
What about the first p terms , , ..., ? Since there are a finite number of these terms, there must be a largest value and a smallest value among them. Suppose that the smallest value is A and the largest value is B. Thus,
Then if is the smaller of A and and is the larger of B and , I must have
Therefore, the sequence is bounded.
Example. Prove that the sequence is bounded.
Therefore, the sequence is bounded.
Copyright 2005 by Bruce Ikenaga