Some sections of this note may still be broken or left incorrectly rendered.
What is a Sequence?
Objectives
Define what is a sequence.
Describe the similarities between a function and a sequence.
Describe the terms of an explicitly defined sequence.
Describe the terms of a recursively defined sequence.
Definition of a Sequence
Simply said, a sequence is an ordered set of numbers.
For instance, these are some examples of sequences:
We can refer to a specific sequence with a capital letter.
We refer to the items inside the sequence as terms of a sequence.
Since a sequence is an ordered set, we can refer to a specific term by referring to its position in the sequence.
We call the position of a term in a sequence as its index.
Referring to specific terms like this can become clunky.
Instead, we use the notation to refer to the first term of the sequence .
We can use this notation to refer terms in other sequences, such as in sequence , by using its small letter counterpart, .
Worked Example #1 Referring and Locating Specific Terms in a Sequence
Let , , and be sequences where:
Therefore, using these information, we can define a sequence as:
Definition Sequence
A sequence is an ordered set of numbers in the form:
where are the terms of the sequence .
The notation represents the term of sequence , where is the index or the position of the term in the sequence
Most often, we can define sequences by simply listing the individual terms.
Defining sequences this way is called the roster method.
However, this becomes very inconvenient if we want more terms in our sequence
Explicit Sequences
Sequences can be defined in various ways.
One way we can define them is by using a function to explicitly define a sequence.
For example, if we have a sequence:
We can automatically generate the first 5 terms of this sequence just from this rule here:
Sequences defined from an explicit function relation are called explicit sequences.
Definition Explicit Sequences
An explicit sequence is a sequence where each term of the sequence is defined as:
where the function is defined for all .
Our definition notes an interesting difference of sequences from functions.
While a function may be defined for all real numbers , an explicit sequence is only be defined for the natural numbers only.
This is because represents the position of a specific term or the order at which it appears in a sequence. Thus, it would not make sense to have term or a term in a sequence.
Worked Example #2 Finding Terms of an Explicitly-Defined Sequence
Find the first terms of the following sequences.
terms in our sequence, we simply have to substitute when to our function.
The first terms of the sequence are:
Recursive Sequences
Aside from defining sequences as an explicit function definition, we can also define a sequence in a different way.
We can define a sequence by making rules on how to get the next term as a function of its previous terms. To see how it looks like, let us take an example.
This sequence tells us that to get the next term in our sequence, we take the previous term , then substitute it on our expression .
However, this isn’t enough to build our sequence. We need a “starting position” for us to build our sequence.
We can then establish that , then by using the rule from before, we can begin building our sequence.
Here, we establish a sequence where the next term is based on its previous terms.
However, to build our sequence, we define a single term in our sequence. This term is what we call the base case of a recursive sequence.
Definition Recursive Sequences
A recursive sequence is a sequence where the next successive term is defined as a function of its preceding terms .
We then define a recursive sequence by defining any term in the sequence that serves an initial term called a base case, then using the rules to get the next succeeding term.
In general, a recursive sequence has the form:
To familiarize ourselves to the concept of a recursive sequence, we dive into it by working our some practice problems:
Worked Example #3 Finding a Specific Term in a Recursive Sequence
Find if the sequence is defined as:
term in the sequence, we must first start with the first term .
Then, we use the rule to find the next terms.
We do this until we get to .
As we can see, we can define sequences recursively to create unique sequences that are otherwise impossible with explicit function definitions.
One example of these sequences is the Fibonacci Sequence.
The Fibonacci sequence is a unique kind of sequence that’s mostly associated, not only with patterns in nature, but with designs in art, architecture, and even the universe itself.
To construct a Fibonacci sequence, we define it as the sum of the previous two terms.
Definition Fibonacci Sequence
The Fibonacci sequence is a special sequence that is defined as the sum of the last two preceding terms. Mathematically, the sequence can be defined recursively as:
Worked Example #4: Finding Terms on a Fibonacci Sequence
Use the definition of the Fibonacci sequence to find its term.
or by starting on the base cases first.
Therefore, the term on a Fibonnaci sequence is .
Arithmetic Sequences
Objectives
Define what is an arithmetic sequence.
Identify an arithmetic sequence.
Describe an arithmetic sequence defined explicitly and recursively.
Find terms on an arithmetic sequence defined explicitly and recursively.
Deduce the common difference given an arithmetic sequence.
In this and the following sections, we will explore some types of sequences that often had many applications in the real world. We can begin tackling them by observing this particular sequence below:
One good observation is when we plot these points in a graph.
Here, the -axis represents the index of our sequence, and the -axis for the value.
{insert photo}
As we can see, the plot of points resemble a straight line.
However, we can see more connections as we take the difference between each consecutive term.
This shows us that to get any term in an arithmetic sequence, we add a multiple of to our first term, . The multiple of must be less than the index of , therefore we can define any arithmetic sequence explicitly as:
Definition General Explicit Form of an Arithmetic Sequence
Every arithmetic sequence, when defined explicitly, can be written as:
where: is the term of the sequence is the term of the sequence is the common difference is the index/position of
Geometric Sequences
Objectives
Define what is a geometric sequence.
Describe a geometric sequence defined explicitly and recursively.
Find terms on an arithmetic sequence defined explicitly and recursively.
Deduce the common ratio given a geometric sequence