Subsection Arithmetic Sequences
Suppose you start a business selling prints of mathematical art. In week zero, you sell two prints. Each week after that, you sell four more prints than you did the previous week. How many prints will you sell in the
th week?
We can easily compute the first few terms of the sequence: How do I know this is correct? From the problem, we see that to get from one term to the next, we must add 4. It is clear then that the recurrence relation for the sequence is
The rate of growth for the sequence is the constant since the difference between any two terms is 4 (note, we could write the recurrence relation as ).
We call sequences with a
constant rate of change arithmetic sequences.
Now let’s find a closed formula for our sequence. The first term is To get we add The next term requires us to add again, which means we have added to our initial term twice. Then we add again, for a total of three times for In fact, to get we will have added to a total of times. Thus, the closed formula for the sequence is
This works for any arithmetic sequence. That is, any sequence with a constant difference will have a
linear closed formula, where the “slope” of the linear function is the common difference.
Arithmetic Sequences.
If the terms of a sequence differ by a constant, we say the sequence is
arithmetic. If the initial term (
) of the sequence is
and the
common difference is
then we have,
Recursive definition:
with
As we did for our example above, for the recursive definition, we need to specify Then we need to express in terms of If we call the first term then For the recurrence relation, by the definition of an arithmetic sequence, the difference between successive terms is some constant, say So or in other words,
Let’s now argue why the closed formula is correct. One way we could do this is by using a technique sometimes called
telescoping (a name which hopefully we become meaningful momentarily).
We write the recurrence relation in its difference form, for all terms starting with and going up to This gives the following:
Now we add all equations together.
On the right-hand side, we have added
to itself
times, so the sum is
On the left-hand side, we get the sum:
But look what happens when we regroup and cancel like terms:
The sum telescopes down to be nice and compact for easy storage.
Putting the two sides together gives us
which becomes
as we claimed.
The telescoping we did above is useful in other contexts (see
Exercise 6), but now that we have established a general form of the closed formula, we can apply it to any arithmetic sequence.
Example 4.2.1.
Find recursive definitions and closed formulas for the arithmetic sequences below. Assume the first term listed is
Solution.
First we should check that these sequences really are arithmetic by taking differences of successive terms. Doing so will reveal the common difference
-
etc. To get from each term to the next, we add three, so The recursive definition is therefore with The closed formula is
-
Here the common difference is
since we add
to 50 to get 43, and so on. Thus we have a recursive definition of
with
The closed formula is
Subsection Geometric Sequences
What about sequences like
This is not arithmetic because the difference between terms is not constant. However, the
ratio between successive terms is constant:
We call such sequences
geometric.
Recognizing that the sequence is geometric lets us easily write down a recursive definition.
with
A closed formula is also not difficult to reason out. How do we get the term
for example? We start with
then multiply by 2 to get
multiply by
again to get
and multiply by
a third time to get
So we multiplied
by
a total of three times, or
It looks like
In general, the recursive definition for the geometric sequence with initial term and common ratio will be
To get the next term we multiply the previous term by
For the general closed formula, we could try something like telescoping again, although we would need to cancel fractions. Instead, let’s illustrate another technique for solving recurrence relations called iteration. The idea here is that we work our way up to and notice the pattern. Write
We must multiply the first term by a number of times, times to be precise. We get
Geometric Sequences.
A sequence is called
geometric if the ratio between successive terms is constant. Suppose the initial term
is
and the
common ratio is
Then we have,
Recursive definition:
with
Example 4.2.2.
Find the recursive and closed formula for the geometric sequences below. Again, the first term listed is
-
-
Solution.
Start by checking that these sequences really are geometric by dividing each term by its previous term. If this ratio really is constant, we will have found
-
etc. Yes, to get from any term to the next, we multiply by So the recursive definition is with The closed formula is
-
The common ratio is
So the sequence has recursive definition
with
and closed formula
Geometric sequences are those which have a growth rate that is
proportional to the sequence itself. Just like you might have seen in calculus, it is exactly the exponential functions that have this property.
In the examples and formulas above, we assumed that the
initial term was
If your sequence starts with
you can easily find the term that would have been
and use that in the formula. For example, if we want a formula for the sequence
and insist that
then we can find
(since the sequence is arithmetic with common difference 3, we have
). Then the closed formula will be
Subsection Beyond Arithmetic and Geometric Sequences
Look at the sequence
which starts
These are called the
triangular numbers since they represent the number of dots in an equilateral triangle (think of how you arrange 10 bowling pins: a row of 4 plus a row of 3 plus a row of 2 and a row of 1).
Is this sequence arithmetic? No, since
and
so there is no common difference. Is the sequence geometric? No.
but
so there is no common ratio. What to do?
Notice that the
differences between terms
do form an arithmetic sequence:
In other words, the rate of change of this sequence is arithmetic:
which immediately gives us the recurrence relation
Another way to think of this is that the
th term of the sequence
is the
sum of the first
terms in the sequence
Thus
is the
sequence of partial sums of the sequence
(
partial sums because we are not taking the sum of all infinitely many terms).
This should become clearer if we expand the recurrence relation to write the triangular numbers like this:
We are really using iteration here. We could also have seen this by using telescoping, taking
Summing these equations, the right-hand side becomes the left-hand side cancels to leave just
If we know how to add up the terms of an arithmetic sequence, we can find a closed formula for a sequence whose differences are the terms of that arithmetic sequence. Consider how we could find the sum of the first 100 positive integers (that is,
). Instead of adding them in order, we regroup and add
The next pair to combine is
Then
Keep going. This gives 50 pairs which each add up to
so
This insight is usually attributed to Carl Friedrich Gauss, one of the greatest mathematicians of all time, who discovered it as a child when his unpleasant elementary teacher thought he would keep the class busy by requiring them to compute the lengthy sum.
In general, using this same sort of regrouping, we find that
Incidentally, this is exactly the same as
which makes sense if you think of the triangular numbers as counting the number of handshakes that take place at a party with
people: the first person shakes
hands, the next shakes an additional
hands and so on.
The point of all of this is that some sequences, while not arithmetic or geometric, can be interpreted as the sequence of partial sums of arithmetic and geometric sequences. Luckily there are methods we can use to compute these sums quickly, which we will explore in the next two sections.