Discrete Mathematics I

Math 1056

By
Dr. Haider

haider.amir@algomau.ca

Department of Computer Science and Mathematics

Algoma University

© 2019 McGraw-Hill Education

 Graphs of Functions
Let f be a function from the set A to the set B. The
graph of the function f is the set of ordered pairs
a, b  | a  A and f a  b .

Graph of f(n) = 2n + 1 Graph of f(x) = x2

from Z to Z Jump to long description from Z to Z
© 2019 McGraw-Hill Education
 Some Important Functions
The floor function, denoted
f  x   x 
is the largest integer less than or equal to x.
The ceiling function, denoted
f  x   x 
is the smallest integer greater than or equal to x
Example:  3.5   3.5 
  1.5     1.5  
© 2019 McGraw-Hill Education
 Floor and Ceiling Functions

Graph of (a) Floor and (b) Ceiling Functions

Jump to long description
© 2019 McGraw-Hill Education
 Floor and Ceiling Functions
TABLE 1 Useful Properties of the Floor and
Ceiling Functions.
(n is an integer, x is a real number)
1a   x  n if and only if n x  n 1
1b   x  n if and only if n  1  x n
1c   x  n if and only if x  1  n  x
1d   x  n if and only if x n  x  1
2  x  1 <  x   x  x  < x 1
3a    x    x 
3b    x    x 
4a   x  n   x   n
4b   x  n   x   n

© 2019 McGraw-Hill Education

 Sequences and Summations

© 2019 McGraw-Hill Education

 Introduction 2

Sequences are ordered lists of elements.

• 1, 2, 3, 5, 8
• 1, 3, 9, 27, 81, …….

Sequences arise throughout mathematics,

computer science, and in many other disciplines,
ranging from botany to music.
We will introduce the terminology to represent
sequences and sums of the terms in the
sequences.
© 2019 McGraw-Hill Education
 Sequences 1

Definition: A sequence is a function from a subset

of the integers (usually either the set {0, 1, 2, 3, 4,
…..} or {1, 2, 3, 4, ….}) to a set S.
The notation an is used to denote the image of the
integer n. We can think of an as the equivalent of
f(n) where f is a function from {0,1,2,…..} to S. We
call an a term of the sequence.

© 2019 McGraw-Hill Education

 Sequences 2

Example: Consider the sequence an where

1
an   an   a1 , a2 , a3...
n
1 1 1
1, , ,
2 3 4

© 2019 McGraw-Hill Education

 Geometric Progression
Definition: A geometric progression is a sequence of the
form: , , , …..
where the initial term a and the common ratio r are real
numbers.
Examples :
1. Let a 1and r  1. Then :
 bn   b0 , b1 , b2 , b3 , b4 ,... 1,  1, 1,  1, 1,...
2. Let a 2 and r 5. Then :
 cn   c0 , c1 , c2 , c3 , c4 ,...  2, 10, 50, 250, 1250,...
3. Let a 6 and r 1/ 3. Then :
 2 2 2 
 d n   d0 , d1 , d 2 , d3 , d 4 ,... 6, 2, , , ,...
 3 9 27 
© 2019 McGraw-Hill Education
 Arithmetic Progression
Definition: A 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.
Examples :
1. Let a  1and d 4 :
 sn   s0 , s1 , s2 , s3 , s4 ,... 1,  1, 1,  1, 1,...
2. Let a 7 and d  3 :
 tn   t0 , t1 , t2 , t3 , t4 ,...  7, 4, 1,  2,  5,...
3. Let a 1and d 2 :
 un   u0 , u1 , u2 , u3 , u4 ,... 1, 3, 5, 7, 9,...
© 2019 McGraw-Hill Education
 Arithmetic Progression
Definition: A 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.
Examples :
1. Let a  1and d 4 :
 sn   s0 , s1 , s2 , s3 , s4 ,... 1,  1, 1,  1, 1,...
2. Let a 7 and d  3 :
 tn   t0 , t1 , t2 , t3 , t4 ,...  7, 4, 1,  2,  5,...
3. Let a 1and d 2 :
 un   u0 , u1 , u2 , u3 , u4 ,... 1, 3, 5, 7, 9,...
© 2019 McGraw-Hill Education
 Recurrence Relations
Definition: 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,
where n0 is a nonnegative integer.
A sequence is called a solution of a recurrence
relation if its terms satisfy the recurrence relation.
The initial conditions for a sequence specify the
terms that precede the first term where the
recurrence relation takes effect.
© 2019 McGraw-Hill Education
 Questions about Recurrence Relations
Example 1: Let {an} be a sequence that satisfies the
recurrence relation an = an−1 + 3 for n = 1,2,3,4,…. and
suppose that a0 = 2. What are a1 , a2 and a3?
[Here a0 = 2 is the initial condition.]
Solution: We see from the recurrence relation that
a1 a0  3 2  3 5
a2 5  3 8
a3 8  3 11

© 2019 McGraw-Hill Education

 Questions about Recurrence Relations
Example 2: Let {an} be a sequence that satisfies
the recurrence relation an = an-1 – an-2 for n =
2,3,4,…. and suppose that a0 = 3 and a1 = 5. What
are a2 and a3?
[Here the initial conditions are a0 = 3 and a1 = 5. ]
Solution: We see from the recurrence relation
that
a2 a1  a0 5  3 2
a3 a2  a1 2  5  3
© 2019 McGraw-Hill Education