Sequences
A sequence is a list of numbers that are in order and follow certain pattern or rule.
When the sequence goes on forever it is called an infinite sequence, otherwise it is a finite sequence.
Each element in a sequence is called a term.
Example of a finite sequence:
A sequence is like a set, except:
- the terms are in order (with sets the order does not matter)
- the same value can appear many times (only once in sets)
A sequence can be defined by an explicit formula or by a recursive one.
Explicit formula
The explicit formula of the above sequence would be:
Recursive formula
The recursive formula would be:
Types of sequences
Arithmetic sequence
In an arithmetic sequence the difference between one term and the next is a constant.
In other words, we just add some value each time on to infinity (or up to an established number).
In general, we can write an arithmetic sequence like this:
Where d is the difference between the terms (called the common difference).
And we can make the rule (explicit formula):
(We use "n-1" because d is not used in the 1st term).
Or expressed in a recursive way:
Geometric sequence
In a geometric sequence each term is found by multiplying the previous term by a constant.
In general, we can write a geometric sequence like this:
Where r is the factor between the terms (called the common ratio).
When
The explicit formula is defined by:
(We use
The recursive formula is defined by:
An example of this type of sequence could be
Defined by
Sequences are functions
Notice that the explicit formulas of sequences work like functions: We input a term number
Sequences are in fact defined as functions. However,