13.1: Sequences Consider the following list of numbers: 2, 5, 10, 17

13.1: Sequences
Consider the following list of numbers:
2, 5, 10, 17, 26, 37, …
Can you write a rule for this list? There may be multiple correct
answers.
Def: A sequence is a function whose domain is the set of positive
integers.
For example, the sequence π‘Žπ‘› = 3𝑛 βˆ’ 1 is a list whose first 5 terms
are: {2, 5, 8, 11, 14}
1.
Find the first five terms of each sequence:
3 𝑛
a. 𝑠𝑛 = ( )
4
b. 𝑝𝑛 =
2𝑛
𝑛2
Notice how the nth term in the sequence is the value of the function at
n. For example, plugging in 20 for n returns the 20th term of the
sequence.
2.
For each sequence, determine π‘Žπ‘› , the nth term of the sequence.
a. 2, 4, 6, 8, 10, …
b. 3, 5, 9, 17, 33, …
1 1
1
3 9
27 81
c. βˆ’ , , βˆ’
,
1
,βˆ’
1
243
d. 1, βˆ’4, 9, βˆ’16, 25, …
e. 1, 2, 6, 24, 120, …
…
3.
Calculate:
a. 6!
b.
c.
10!
8!
12!
4!8!
(𝑛+2)!
d. (π‘›βˆ’1)!
Here’s another way we could denote factorial:
π‘Ž1 = 1;
π‘Žπ‘› = 𝑛 βˆ™ π‘Žπ‘›βˆ’1
This is called a recursively defined sequence. A recursive sequence will
always have one or more base cases and a rule for calculating each
term based on its predecessor(s).
4.
Write down the first 5 terms of the recursive sequence:
a. π‘Ž1 = 8; π‘Žπ‘› = 2 βˆ’ π‘Žπ‘›βˆ’1
b. π‘Ÿ1 = 1;
π‘Ÿπ‘› = π‘Ÿπ‘›βˆ’1 + 2𝑛 βˆ’ 1
c. 𝑓1 = 1;
𝑓2 = 1;
𝑓𝑛 = π‘“π‘›βˆ’2 + π‘“π‘›βˆ’1
Sometimes, we don’t want to just find the first n terms in a sequence;
we want to find their sum! It can get a little cumbersome writing down
π‘Ž1 + π‘Ž2 + π‘Ž3 + β‹― + π‘Žπ‘› . Instead, we will often use summation
notation:
𝑛
βˆ‘ π‘Žπ‘˜ = π‘Ž1 + π‘Ž2 + π‘Ž3 + β‹― + π‘Žπ‘›
π‘˜=1
5.
Find the sums:
a.
4
βˆ‘ π‘˜3 βˆ’ 3
π‘˜=1
b.
5
βˆ‘ 2π‘˜ 2 + 5π‘˜
π‘˜=3
Some properties:
And some formulas:
6.
Use properties (1)-(8) to calculate the sums:
a.
20
βˆ‘ 3π‘˜ βˆ’ 4
π‘˜=1
b.
30
βˆ‘ 5π‘˜ 2 + π‘˜
π‘˜=9
c.
50
βˆ‘ 7 βˆ’ π‘˜3
π‘˜=13
Homework 13.1a:
p. 946: #9-77 EOO, 86-88
Homework 13.1b:
p. 946: #11-79 EOO, 93, 97-99