Read · 3 min
A sequence is a list of elements, also known as members. If the order of the members of the sequence are switched, then the sequence is not the same.
The length of a sequence is the number of elements in it; it can either be finite or infinite. For example the sequence (1,2,3,...) is an infinite sequence, and the sequence (1,3,5) is a finite sequence.
There are several different notations for sequences, and the one shown above will be used in this article. Other types can be found on the web.
Note that the element in a sequence is denoted as . This can be used to do a variety of things.
There are 3 main types of sequences: arithmetic, geometric, and recurrences.
Arithmetic sequences are ones where there is a common difference between every consecutive term. Ex:(1,3,5) is an arithmetic sequence since the common difference is .
The common difference is commonly denoted as the variable . This can be used to find the sum of a finite arithmetic sequence (also known as a series). The formula for an arithmetic series is:
where is the length of the sequence. Note that for infinite arithmetic series, the sum is obviously infinity. See if you can derive it by yourself! (Algebraically or intuitively)
Geometric sequences are very similar, apart from the fact that they do not have a common difference, instead they have a common... ratio! Here's an example: (1,3,9) is an geometric sequence since the common ratio is .
The common ratio is commonly denoted as the variable .This be used to find the sum of a geometric sequence (also known as a series). The formula for a geometric series is:
where is the first term. Don't bother memorizing this formula since it's rather complicated. Instead, just try to prove it!
Hint: The proof is very simple, but beautiful at the same time.
When the geometric series is infinite, the formula becomes:
. See why this happens!!!
The final general type of sequences are recurrences. Recurrences are sequences where several initial terms are given, and the remaining terms are defined as a function of the previous ones.
A very famous example are the Fibonacci numbers. Their recurrence relation is:
Where .
Now you may be thinking, what if I want to find the 100th term of the Fibonacci sequence? Do I have to compute all the previous terms before it?(This is a lot of computation!)
Lucky for you, there is a simpler way! This is known as the close form of a recurrence. All recurrences have closed forms, some more complicated than others.
Closed forms do not require the values of previous terms, an Ex. is . The 100th term can be found by just plugging in 100 into the formula! Isn't that convenient!
Sadly, deriving the closed form of a recurrence can be very pain-staking. If you really want to have a go at it, I would recommend trying it on a simpler recurrence than the Fibonacci sequence.* This is because the closed form of the Fibonacci sequence is rather complicated. It is known as Binet's formula; go check it out if you're curious!
*Hint: Try substituting into the recurrence for and then divide by . This is also known as the characteristic equation.
Sequences are one of the most interesting parts of mathematics, and I would recommend looking them up if you're interested. This article only scratches the surface of the topic, so go looking for other interesting branches!


