Scribd
Upload
173 views5 pages

2.4 Sequences and Summations

The document summarizes key concepts relating to sequences and summations from a discrete mathematics course. It defines different types of sequences like geometric progressions, arithmetic progressions, and recurrence relations. It also defines summations and provides examples of common summations and closed forms. Finally, it includes examples of problems solving sequences, recurrence relations, and evaluating summations.

Uploaded by

Fahad Dar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
173 views5 pages

2.4 Sequences and Summations

The document summarizes key concepts relating to sequences and summations from a discrete mathematics course. It defines different types of sequences like geometric progressions, arithmetic progressions, and recurrence relations. It also defines summations and provides examples of common summations and closed forms. Finally, it includes examples of problems solving sequences, recurrence relations, and evaluating summations.

Uploaded by

Fahad Dar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

ICS 141: Discrete Mathematics I (Fall 2014)

2.4 Sequences and Summations


Sequences

Sequences are ordered lists of elements.

Geometric Progression

A geometric progression is a sequence of the form

a, ar, ar2 , . . . , arn

where the initial term a and the common ratio r are real numbers.

Arithmetic Progression

An arithmetic progression is a sequence of the form

a, a + d, a + 2d, . . . , a + nd

where the initial term a and the common difference d are real numbers.

Recurrence Relation

A recurrence relation for the sequence {an } is an equation that expresses an in terms of one or
more of the previous terms of the sequence, namely, a0 , a1 , . . . , an−1 , for all integers n with n ≥ n0
is a nonnegative integer. A sequence is called a solution of a recurrence relation if its terms satisfy
the recurrence relation.

Fibonacci Sequence

The Fibonacci sequence, f0 , f1 , f2 , . . ., is defined by the initial condition f0 = 0, f1 = 1, and the


recurrence relation
fn = fn−1 + fn−2
for n = 2, 3, 4, . . ..

Summations
n
P
ai means “ak + ak+1 + ak+2 + ak+3 + . . . + an ”
i=k
for each i from k to n, find ai and sum the results.

1
ICS 141: Discrete Mathematics I (Fall 2014)

Common Summations and Closed Forms


Sum Closed Form
n arn+1 − a
ark (r 6= 0)
P
, r 6= 1
k=0 r−1
n
P n(n + 1)
k
k=1 2
n n(n + 1)(2n + 1)
k2
P
k=1 6
n n2 (n + 1)2
k3
P
k=1 4
∞ 1
xk , |x| < 1
P
k=0 1−x
∞ 1
kxk−1 , |x| < 1
P
k=1 (1 − x)2

2.4 pg 167 # 1

Find these terms of the sequence {an }, where an = 2 · (−3)n + 5n .

a) a0
2 · (−3)0 + 50 = 3

b) a1
2 · (−3)1 + 51 = −1

c) a4
2 · (−3)4 + 54 = 2 · 81 + 625 = 162 + 625 = 787

2.4 pg 168 # 13

Is the sequence {an } a solution of the recurrence relation an = 8an−1 − 16an−2 if

a) an = 0?
To solve these problems, we need to substitute the value of an into the recurrence relation
and see if they are equal.
0 = 8 · 0 − 16 · 0
=0
Yes

b) an = 1?
1 = 8 · 1 − 16 · 1
= 8 − 16
= −8
No.

2
ICS 141: Discrete Mathematics I (Fall 2014)

c) an = 2n ?
2n = 8 · 2n−1 − 16 · 2n−2
= 8 · 2 · 2n−2 − 16 · 2n−2
= 2n−2 (8 ∗ 2 − 16)
= 2n−2 (16 − 16)
= 2n−2 (0)
=0
No.

d) an = 4n ?
4n = 8 · 4n−1 − 16 · 4n−2
= 8 · 4 · 4n−2 − 16 · 4n−2
= 4n−2 (8 · 4 − 16)
= 4n−2 (8 · 4 − 16)
= 4n−2 (32 − 16)
= 4n−2 (16)
= 4n−2 · 42
= 4n
Yes.

2.4 pg 168 # 17

Find the solution to each of these recurrence relations and initial conditions. Use an iterative
approach.

a) an = 3an−1 , a0 = 2
a1 = a0 · 3 = (2) · 3
a2 = a1 · 3 = (2 · 3) · 3
a3 = a2 · 3 = (2 · 3 · 3) · 3
...
an = 3 · an−1 = 2 · 3n
In a1 , a2 , a3 , we see that the number of times we multiply by three is equal to the value of
our subscript. We also see that a0 is included once in each of our terms. so, an = 2 · 3n .
Note: Since we can express this relation in the form a · rn , it is a geometric progression.

b) an = an−1 + 2, a0 = 3
a1 = a0 + 2 = (3) + 2
a2 = a1 + 2 = (3 + 2) + 2
a3 = a2 + 2 = (3 + 2 + 2) + 2
...
an = an−1 + 2 = 3 + 2n
Again, in a1 , a2 , a3 , we see that the number of times we add two is equal to the value of our
subscript. And again a0 is included once in each of our terms. So, an = 3 + 2 · n. Note:
Since we can express this relation in the form a + d · n, it is an arithmetic progression.

3
ICS 141: Discrete Mathematics I (Fall 2014)

2.4 pg 168 # 19

Suppose that the number of bacteria in a colony triples every hour.

a) Set up a recurrence relation for the number of bacteria after n hours have elapsed.
Since the number of bacteria at n hours is three times the bacteria at n − 1 hours, our
recurrence relation is an = 3an−1

b) If 100 bacteria are used to begin a new colony, how many bacteria will be in the colony in
10 hours?
We first solve the recurrence relation by iteration.
a1 = 3 · a0 = 3 · (100)
a2 = 3 · a1 = 3 · (3 · 100)
a3 = 3 · a2 = 3 · (3 · 3 · 100)
...
an = 3 · an−1 = 3n · 100
So, a10 = 310 · 100 = 5, 904, 900

2.4 pg 169 # 29

What are the values of these sums?


5
P
a) (k + 1)
k=1

= (1 + 1) + (2 + 1) + (3 + 1) + (4 + 1) + (5 + 1)
=2+3+4+5+6
= 20
8
(2j+1 − 2j )
P
d)
j=0

= (20+1 − 20 ) + (21+1 − 21 ) + (22+1 − 22 ) + (23+1 − 23 ) + (24+1 − 24 ) + (25+1 − 25 ) +


(26+1 − 26 ) + (27+1 − 27 ) + (28+1 − 28 )
= (21 − 20 ) + (22 − 21 ) + (23 − 22 ) + (24 − 23 ) + (25 − 24 ) + (26 − 25 ) + (27 − 26 ) + (28 −
27 ) + (29 − 28 )
= −20 + 29
= −1 + 512
= 511

2.4 pg 169 # 33

Compute each of these double sums.


2 P
P 3
a) (i + j)
i=1 j=1

4
ICS 141: Discrete Mathematics I (Fall 2014)

2
P
= ((i + 1) + (i + 2) + (i + 3))
i=1
P2
= (3i + 6)
i=1
= (3(1) + 6) + (3(2) + 6)
=3+6+6+6
= 21
3 P
P 2
c) i
i=1 j=0
3
P
= (i + i + i)
i=1
= (1 + 1 + 1) + (2 + 2 + 2) + (3 + 3 + 3)
=3+6+9
= 18

2.4 pg 169 # 39
200
P
Find k.
k=100
200
P
k
k=100
200
P 99
P
= k− k
k=1 k=1
200(200 + 1) 99(99 + 1)
= −
2 2
200(201) 99(100)
= −
2 2
40200 9900
= −
2 2
= 20100 − 4950
= 15150

You might also like