BAMS1623

Discrete Mathematics
Chapter 1 Fundamental

Content
 Sets and Subsets
 Operations and Notions of Sets
 Sequences – explicit and recursive patterns
 Properties of integers
 Division of integers
 Matrices and its operations

1
Sets and Subsets

 One way to describe a set with a finite number of elements is by listing the
elements of the set between braces. E.g 1,2,3

 The order in which the elements are listed is not important.

 Repeated elements in the listing can be ignored. Example:

are the representation of the set

1,2,3
 Element – We indicate x is an element of the set A by x  A and not element of
A by x  A

Sets and Subsets

 Another way to define a set is by specifying a property defined by says, P(x)
and written as

 Example:

Example:

2
Subsets

Sets and Subsets (Con’t)

3
 Operations on Sets
Union

Intersection

Complement

Example:

4
 Symmetric Difference

U
A U
B A
B

A B

Algebraic Properties of Set Operations

Commutative Properties Properties of Complement

Associative Properties

Distributive Properties Properties of a Universal Set

Idempotent Properties Properties of Empty Set

5
Addition Principles

Example

6
Sequences

 A list of objects arranged in a definite order;

1st element, 2nd element, 3rd element and so
on.
 It may stop after n steps (finite) or go on
forever (infinite).
 The elements may all be different or some
may be repeated.
 Example:

Recursive and Explicit

Recursive
 A formula that refers to previous terms to define the
next term is called recursive.
 Every recursive formula must include a starting
place.
 Example:

Explicit
 A formula that tells exactly what value any particular
term has.
 Example:

7
Sequence (Con’t)
 The set corresponding to a sequence is simply the set of all
distinct elements in the sequence. E.g: The set corresponding to
the sequence a,b,a,b,a,b,… is simply {a,b}.

 Sequences of letters or other symbols written without the

commas are refered to as strings. E.g: sequence a,b,a,b,a,b,…
infinite string abababab…

 Sometimes a sequence is called a linear array or list in

computer science. An array may be viewed as a sequence of
positions.

 Elements assigned to position n will be denoted by S(n) and the

sequence S(1),S(2),S(3),… will be called the sequence of
values of the array S.

Exercise

8
Characteristic Functions

Example: Characteristic Functions

Example:

9
Induction and Recursion

Example

1. When n = 1, 34 - 1 = 33, which is divisible by 11.

2. Assume n= k is true, 34k - 1 is divisible by 11

3. When n = k+1, 34k+1 - 1 = 34. 34k - 1 = (33 + 1)34k - 1

=33 (34k) + 34k - 1
=11 (3. 34k ) + (34k - 1)

10
Division in the integers

Example:
26 = 2.13
12 = 2.2.3 = 22.3
24 = 2.2.2.3 = 23.3 2299 = 11.11.19 = 112.19

Greatest Common Divisor (GCD)

11
 Least Common Multiple (LCM)

GCD and LCM

Euclidean Algorithm – a procedure for finding GCD(a,b),

a > b > 0.

12
Example: Theorem 5

Example : Euclidean Algorithm

13
Boolean Matrix Operations
Boolean matrix (also called a bit matrix) is an m x n matrix
which entries are either zero or one

Boolean Matrix Operation (* only possible when A and B

have the same size)

Worked Example

1 1 1
1 1 1
 
1 1 1
 
1 1 0

14
Boolean Product

Worked Example

* Note:
e11 = 1 since row 1 of A and column 1 of B each
has a 1 as the first entry.
e12 =1 since a12=1 and b22=1 i.e. the first row of A
and the 2nd column of B have 1 in the 2nd position

15
Exercise

 Let A and B be sets and suppose x  A  B means that x A

or x  B but x  A  B . Show that A  A  
3 marks

Exercise
 Let A = {1,2,3,4,5}, B = {2,4,6,8,10} and C = {8,10,12}.
Find ( A  B )  C if A  B  ( A  B )  ( B  A).

(5 m)

16
Exercise

Exercise
Let U = {0,1,2,3,4,5,6,7,8,9,10}
A  x  U 0  x  2and B  x  U 1  x  4.

Find each of the following sets

(7m)

(i) A B

(ii) A B

(iii) A  B

17