Scribd
Upload
20 views19 pages

Lecture-5 3

Uploaded by

wvwvwvbebeebebeve
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
20 views19 pages

Lecture-5 3

Uploaded by

wvwvwvbebeebebeve
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/ 19

Chapter 2

Basic Structures: Sets, Functions,


Sequences, Sums, and Matrices
Section 2.4 : Sequences and Summations
Sequences
 A sequence is a discrete structure used to represent an
ordered list.
 It is defined as a function from a subset of the set of
integers (usually either the set {0, 1, 2, . . .} or the set {1, 2,
3, . . .}) to a set .
 We use the notation to denote the image of the
integer .
 We call a term of the sequence.
Sequences (Contd.)
 Example 1:
Consider the sequence , where,

1
=

 Solution:
The list of the terms of this sequence, beginning with [ is
not possible as = ∞ and the domain of the function
is 1, 2, 3, … ] are, , , , , …
Thus, the sequence will be 1, , , , …
Progressions
 Geometric Progression:
 A sequence of the form , , ,…, ,…
 The initial term and the common ratio are real numbers.
 It is a discrete analogue of the exponential function = .

 Arithmetic Progression:
 A sequence of the form , + , + 2 , … , + , …
 The initial term and the common difference are real
numbers.
 It is a discrete analogue of the linear function = + .
Progressions (Contd.)
 Example 2:
Consider the following sequences
a. with = −1
b. with =2 5
c. with =6

Find out the following,


1. What type of progressions are they?
2. What are the initial terms and common factors?
3. Find the list of terms in the sequences and their values.
Progressions (Contd.)
 Solution:
1. The progressions in , , are all geometric progressions.
2. The initial terms and the common ratios are listed below,
Initial Terms Common Ratio
a. 1 −1
b. 2 5
1
c. 6
3
3. The list of terms and their values are listed below,
Terms Values
a. , , , , ,… 1, −1,1, −1,1, …
b. , , , , ,… 2,10,50,250,1250, …
2 2 2
c. , , , , ,… 6,2, , , , …
3 9 27
Progressions (Contd.)
 Example 3:
Consider the following sequences
a. with = −1 + 4
b. with =7−3

Find out the following,


1. What type of progressions are they?
2. What are the initial terms and common factors?
3. Find the list of terms in the sequences and their values.
Progressions (Contd.)
 Solution:
1. The progressions in , are all arithmetic progressions.
2. The initial terms and the common differences are listed
below, Initial Terms Common Difference
a. −1 4
b. 7 −3

3. The list of terms and their values are listed below,

Terms Values
a. , , , ,… −1,3,7,11, …
b. , , , ,… 7,4,1, −2, …
Recurrence Relations
 A for the sequence { } is
 An equation that expresses in terms of one or more of the
previous terms of the sequence, namely, , , . . . , , for all
integers with ≥ , where is a nonnegative integer.
 A sequence is called a of a recurrence
relation if its terms satisfy the recurrence relation.
 A recurrence relation is said to a
sequence.
Recurrence Relations (Contd.)
 Example 4:
Consider the sequence { } which satisfies the recurrence
relation = + 3 for = 1, 2, 3, … and suppose that =
2. What are , , ?

 Solution :
From the recurrence relation it is clear that,
 = +3=2+3=5
 = +3=5+3=8
 = + 3 = 8 + 3 = 11
Recurrence Relations (Contd.)
 Example 5:
Consider the sequence { } which satisfies the recurrence
relation = − for = 2, 3, 4, … and suppose that
= 3 and = 5. What are , , , ?

 Solution :
From the recurrence relation it is clear that,
 = − =5−3=2
 = − = 2 − 5 = −3
 = − = −3 − 2 = −5
 = − = −5 − −3 = −2
Recurrence Relations (Contd.)
 One of the most commonly used sequences defined by a
recurrence relation is the .
 It is defined by
 The initial conditions, = 0 and = 1.
 The recurrence relation = + for = 2, 3, 4, …
 The is as follows,
 = + = 1 + 0 = 1,
 = + = 1 + 1 = 2,
 = + = 2 + 1 = 3,
 = + = 3 + 2 = 5,
 = + = 5 + 3 = 8. ……….
Recurrence Relations (Contd.)
 We say that we have solved the recurrence relation
together with the initial conditions when we find an
explicit formula, called a closed formula, for the terms
of the sequence.
Recurrence Relations (Contd.)
 Example 6:
Determine whether the sequence { }, where = 3 for every
nonnegative integer , is a solution of the recurrence relation
= 2 − for = 2, 3, 4, . . . .

 Solution:
Suppose that = 3 for every nonnegative integer .
Then, for ≥ 2, we see that,

2 − = 2 3 − 1 − 3 − 2
= 3
= .

Therefore, { }, where = 3 , is a solution of the recurrence relation.


Recurrence Relations (Contd.)
 Example 7:
Determine whether the sequence { }, where = 2 for every nonnegative integer , is a
solution of the recurrence relation
= 2 − for = 2, 3, 4, . . . .

 Solution:
Suppose that = 2 for every nonnegative integer .
Note that, = 1, = 2, = 4.
Then, for ≥ 2, we see that,

=2 −
=2 −
=2 2−1
=3
But, = 4 from the equation =2 .
Therefore, { }, where = 2 , is not a solution of the recurrence relation.
Recurrence Relations (Contd.)
 Example 8:
Solve the recurrence relation = + 3 with the initial condition = 2.

 Solution:
Starting with the initial condition = 2 and applying the recursive relation successively
upward until we reach , we will try to find a closed formula for the sequence .

= +3=2+3
= +3= 2+3 +3=2+3 2
= +3= 2+3 2 +3=2+3 3
.
.
.
= +3= 2+3 −2 +3=2+3 −1

Evaluating at the initial condition i.e. , we get, =2+3 1 − 1 = 2.

Thus, the closed formula for the sequence is =2+3 −1


Summations
 Required for adding up the terms of a sequence.
 The following formula is used for calculating the sum of
terms of a geometric progression. Where, and are
real numbers and ≠ 0.

−
= , ≠1
−1
+1 , =1
Summations (Contd.)
THE END

You might also like