SlideShare a Scribd company logo
Discrete Structure
Mathematics
Course: Discrete
Structures
(501215-3)
Prepared by : DR. AMR RASHED
PhD in Electronics &
Communication Engineering
References
1-Rosen, Kenneth H. "Discrete Mathematics and
Its Applications.“ seventh edition
2-introduction to set theory
3-rational numbers
4-Introduction to rational and irrational numbers
5-Classification of Numbers
6-SUBSETS AND POWER SETS
Course Content:
Chapter 2: Basic
Structures: Sets,
Functions, Sequences,
Sums, and Matrices
Chapter 8: Advanced
Counting Techniques
Chapter 1: The
Foundations: Logic and
Proofs
Chapter 4: Number
Theory and Cryptography
Chapter 5: Induction and
Recursion
Chapter 6: Counting
Chapter 2
Basic Structures: Sets,
Functions, Sequences,
and Sums
Contents 2.1 Sets
2.2 Set Operations
2.3 Functions
2.4 Sequences and Summations
Set Theory
• Definition 1: A set is an unordered collection of objects
• A={1,2,3}
• Definition 2: Objects in a set are called elements, or members of the
set.
• We write a  A to denote that a is an element of the set A.
• we write a  A to denote that a is not an element of the set A.
• It is common for sets to be denoted using uppercase letters.
• Lowercase letters are usually used to denote elements of sets.
• There are several ways to describe a set. One way is to list all the
members of a set, when this is possible. We use a notation where
all members of the set are listed between braces. For example, the
notation {a, b, c, d} represents the set with the four elements a, b, c,
and d. This way of describing a set is known as the roster method.
.1 .2
.3
Visual
List Notation
• The set V of all vowels in the English alphabet can be
written as
• V = {a, e, i, o, u}
• The set O of odd positive integers less than 10 can be
expressed by
• O = {1, 3, 5, 7, 9}
• Although sets are usually used to group together elements with
common properties, there is nothing that prevents a set from
having seemingly unrelated elements. For instance, {a, 2, Fred,
New Jersey} is the set containing the four elements a, 2, Fred,
and New Jersey.
• Sometimes the roster method is used to describe a set without
listing all its members. Some members of the set are listed, and
then ellipses (. . .) are used when the general pattern of three
elements is obvious.
• The set of positive integers less than 100 can be denoted by {1,
2, 3, . . . , 99}.
Set builder notation
• Another way to describe a set is to use set builder
notation. We characterize all those elements in the
set by stating the property or properties they must
have to be members. For instance, the set O of all
odd positive integers less than 10 can be written as
• O = {x|x is an odd positive integer less than 10}
or O = {x ℤ +|x is odd and x<10}
• Q={…,
1
1
,
1
2
,
1
3
,…} ={
𝑚
𝑛
| m, n ∈ ℤ n≠ 0}
• Even integers:
• 2 ℤ={…,-4,-2,0,2,4,…}={2n | n ∈ ℤ}
Additional points
• Sets can be finite or infinite
• A={1, 2, 3, 4, 5, 6}
• Z+ = 1, 2, 3, 4, … all positive integers
• Repeated elements are listed once
• {a, b, a, c, b, a, c}={a, b, c}
• There is no order in a set
• {3,2,1}={1,2,3}={2,1,3}
.a .b
.c
Number systems
• N={1, 2, 3, …}, or {0,1,2,3,…}natural numbers or counting numbers
• W={0,1,2,3,…},whole numbers
• Z={…,-2, -1, 0, 1, 2, …}, integers
• Z+={1, 2, 3, …}, positive integers, zero is neither positive nor negative
• Q={p/q|pZ, qZ, and q0}, rational numbers (fraction numbers and decimals numbers)
• Q+={xR|x=p/q, for positive integers p and q}
• C, the set of complex numbers.
• R, real numbers, i = −1 is not real number
• R+, the set of positive real numbers
• Terminating decimal numbers (finite) and recurring decimal numbers( infinite and repeating)
• Irrational number never terminate and never repeated, there is only one irrational number between any two rational
numbers.
• To get irrational numbers (square ,sum with irrational (rational+irr) , prod with irrational (rational *irr))
Rational numbers
• Rational numbers=
𝑃
𝑄
p,q are integers , q≠ 0
• 3=
9
3
=
3
1
also 2.5=
25
10
=
5
2
• Terminating decimal (finite)
• 2.5, 3.1, 4.65
• Recurring decimal (infinite and repeating)
•
2
3
= 0.666 = 0.6
•
1
6
= 0.1666 = 0.16
• Test :
37
250
=
37
5∗5∗2∗5
Common sets
Intervals
• Recall the notation for intervals of real numbers. When a and b are
real numbers with a < b, we write
• [a, b] = {x | a ≤ x ≤ b} closed interval
• [a, b) = {x | a ≤ x < b}
• (a, b] = {x |a < x ≤ b}
• (a, b) = {x |a < x < b} open interval
Example
• The set {N,Z,Q,R} is a set containing four elements, each of which is
a set. The four elements of this set are N, the set of natural
numbers; Z, the set of integers; Q, the set of rational numbers; and
R, the set of real numbers.
• Remark: Note that the concept of a datatype, or type, in computer
science is built upon the concept of a set. In particular, a datatype
or type is the name of a set, together with a set of operations that
can be performed on objects from that set. For example, boolean is
the name of the set {0, 1} together with operators on one or more
elements of this set, such as AND, OR, and NOT.
Definition 3
• Definition 3: Two sets are equal if and only if they
have the same elements.
A=B if x(x  A  x  B)
• {1, 3, 5} and {3, 5, 1} are equal
• The sets {1, 3, 5} and {3, 5, 1} are equal, because they have the
same elements. Note that the order in which the elements of a set
are listed does not matter. Note also that it does not matter if an
element of a set is listed more than once, so {1, 3, 3, 3, 5, 5, 5, 5} is
the same as the set {1, 3, 5} because they have the same elements.
The Empty set
• Empty set (null set):  (or {})
• There is a special set that has no elements. This set is called the
empty set or null set, and is denoted by ∅. The empty set can also
be denoted by { } (that is, we represent the empty set with a pair of
braces that encloses all the elements in this set). Often, a set of
elements with certain properties turns out to be the null set. For
instance, the set of all positive integers that are greater than their
squares is the null set.
• A set with one element is called a singleton set. A common error is
to confuse the empty set ∅ with the set {∅}, which is a singleton set.
The single element of the set {∅} is the empty set itself ! A useful
analogy for remembering this difference is to think of folders in a
computer file system. The empty set can be thought of as an empty
folder and the set consisting of just the empty set can be thought of
as a folder with exactly one folder inside, namely, the empty folder.
Venn diagram
• Venn diagram to graphically represent sets
• Universal set U: rectangle
• Sets: circles
• Elements of a set: point
FIGURE 1 Venn Diagram for the Set of Vowels.
Subsets
• Definition 4: The set A is a subset of B if and only if
every element of A is also an element of B.
A  B if x(x  A  x  B)
• Theorem 1: For every set S,
(1)   S and (2) S  S.
• Proper subset: A is a proper subset of B, we note
A  B, if
x(x  A  x  B)  x(x  B  x  A)
Subsets
• If AB and BA, then A=B
• Sets may have other sets as members
• A={, {a}, {b}, {a,b}}
B={x|x is a subset of the set {a,b}}
• A=B
FIGURE 2 Venn Diagram Showing that A Is a Subset of B.
The Size of a Set
• Definition 5: If there are exactly n distinct members
in the set S (n is a nonnegative integer), we say
that S is a finite set and that n is the cardinality of
S.
• |S|= n
• ||=0 , |{}|=1 ,|{ }|=0
• Definition 6: a set is infinite if it’s not finite.
• Z+
Elements and cardinality
• Let C={yellow, blue, red}
• Yellow is an element of C ,yellow∈ 𝐶
• Green is not an element of C, Green ∉ 𝐶
• The cardinality (size) of C is 3 ,|c|=3
Exercise
• List the elements of D. D={x ∈ ℤ+
| x<6}
• 1,2,3,4,5
• What is the cardinality of D?
• |D|=5
• What is the cardinality of {,{a,b}}
• 2
• What is the cardinality of {,{a},{b}}
• 3
• What is the cardinality of {,a,{b}}
• 3

More Related Content

What's hot

Maths-->>Eigenvalues and eigenvectors
Maths-->>Eigenvalues and eigenvectorsMaths-->>Eigenvalues and eigenvectors
Maths-->>Eigenvalues and eigenvectors
Jaydev Kishnani
 
Predicates and Quantifiers
Predicates and QuantifiersPredicates and Quantifiers
Predicates and Quantifiers
blaircomp2003
 
Set in discrete mathematics
Set in discrete mathematicsSet in discrete mathematics
Set in discrete mathematics
University of Potsdam
 
Eigenvalues and Eigenvectors
Eigenvalues and EigenvectorsEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
Vinod Srivastava
 
System Of Linear Equations
System Of Linear EquationsSystem Of Linear Equations
System Of Linear Equations
saahil kshatriya
 
Principle of mathematical induction
Principle of mathematical inductionPrinciple of mathematical induction
Principle of mathematical induction
Kriti Varshney
 
09 permutations
09   permutations09   permutations
09 permutations
Taradiddle81
 
Mathematical Logic
Mathematical LogicMathematical Logic
Mathematical Logic
Joey Valdriz
 
Functions in discrete mathematics
Functions in discrete mathematicsFunctions in discrete mathematics
Functions in discrete mathematics
Rachana Pathak
 
Pigeonhole Principle
Pigeonhole PrinciplePigeonhole Principle
Pigeonhole Principle
nielsoli
 
Recurrence relations
Recurrence relationsRecurrence relations
Recurrence relations
IIUM
 
System of linear equations
System of linear equationsSystem of linear equations
System of linear equations
Diler4
 
Theory of Computation Lecture Notes
Theory of Computation Lecture NotesTheory of Computation Lecture Notes
Theory of Computation Lecture Notes
FellowBuddy.com
 
Rank nullity theorem
Rank nullity theoremRank nullity theorem
Rank nullity theorem
Roqui Gonzaga
 
Divide and conquer 1
Divide and conquer 1Divide and conquer 1
Divide and conquer 1
Kumar
 
CMSC 56 | Lecture 14: Representing Relations
CMSC 56 | Lecture 14: Representing RelationsCMSC 56 | Lecture 14: Representing Relations
CMSC 56 | Lecture 14: Representing Relations
allyn joy calcaben
 
THE BINOMIAL THEOREM
THE BINOMIAL THEOREM THE BINOMIAL THEOREM
THE BINOMIAL THEOREM
τυσηαρ ηαβιβ
 
Matlab on basic mathematics
Matlab on basic mathematicsMatlab on basic mathematics
Matlab on basic mathematics
monauweralam1
 
Relations in Discrete Math
Relations in Discrete MathRelations in Discrete Math
Relations in Discrete Math
Pearl Rose Cajenta
 
Longest Common Subsequence
Longest Common SubsequenceLongest Common Subsequence
Longest Common Subsequence
Krishma Parekh
 

What's hot (20)

Maths-->>Eigenvalues and eigenvectors
Maths-->>Eigenvalues and eigenvectorsMaths-->>Eigenvalues and eigenvectors
Maths-->>Eigenvalues and eigenvectors
 
Predicates and Quantifiers
Predicates and QuantifiersPredicates and Quantifiers
Predicates and Quantifiers
 
Set in discrete mathematics
Set in discrete mathematicsSet in discrete mathematics
Set in discrete mathematics
 
Eigenvalues and Eigenvectors
Eigenvalues and EigenvectorsEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
 
System Of Linear Equations
System Of Linear EquationsSystem Of Linear Equations
System Of Linear Equations
 
Principle of mathematical induction
Principle of mathematical inductionPrinciple of mathematical induction
Principle of mathematical induction
 
09 permutations
09   permutations09   permutations
09 permutations
 
Mathematical Logic
Mathematical LogicMathematical Logic
Mathematical Logic
 
Functions in discrete mathematics
Functions in discrete mathematicsFunctions in discrete mathematics
Functions in discrete mathematics
 
Pigeonhole Principle
Pigeonhole PrinciplePigeonhole Principle
Pigeonhole Principle
 
Recurrence relations
Recurrence relationsRecurrence relations
Recurrence relations
 
System of linear equations
System of linear equationsSystem of linear equations
System of linear equations
 
Theory of Computation Lecture Notes
Theory of Computation Lecture NotesTheory of Computation Lecture Notes
Theory of Computation Lecture Notes
 
Rank nullity theorem
Rank nullity theoremRank nullity theorem
Rank nullity theorem
 
Divide and conquer 1
Divide and conquer 1Divide and conquer 1
Divide and conquer 1
 
CMSC 56 | Lecture 14: Representing Relations
CMSC 56 | Lecture 14: Representing RelationsCMSC 56 | Lecture 14: Representing Relations
CMSC 56 | Lecture 14: Representing Relations
 
THE BINOMIAL THEOREM
THE BINOMIAL THEOREM THE BINOMIAL THEOREM
THE BINOMIAL THEOREM
 
Matlab on basic mathematics
Matlab on basic mathematicsMatlab on basic mathematics
Matlab on basic mathematics
 
Relations in Discrete Math
Relations in Discrete MathRelations in Discrete Math
Relations in Discrete Math
 
Longest Common Subsequence
Longest Common SubsequenceLongest Common Subsequence
Longest Common Subsequence
 

Similar to Discrete Structure Mathematics lecture 1

Discrete Math Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, ...
Discrete Math Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, ...Discrete Math Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, ...
Discrete Math Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, ...
Amr Rashed
 
set an introduction.pptx
set an introduction.pptxset an introduction.pptx
set an introduction.pptx
honeybal egipto
 
Introduction to Sets
Introduction to SetsIntroduction to Sets
Introduction to Sets
Ashita Agrawal
 
sets.pptx
sets.pptxsets.pptx
Set theory
Set theorySet theory
Set theory
Gaditek
 
Moazzzim Sir (25.07.23)CSE 1201, Week#3, Lecture#7.pptx
Moazzzim Sir (25.07.23)CSE 1201, Week#3, Lecture#7.pptxMoazzzim Sir (25.07.23)CSE 1201, Week#3, Lecture#7.pptx
Moazzzim Sir (25.07.23)CSE 1201, Week#3, Lecture#7.pptx
KhalidSyfullah6
 
Blackbox task 2
Blackbox task 2Blackbox task 2
Blackbox task 2
blackbox90s
 
Set theory
Set theorySet theory
Set theory
Shiwani Gupta
 
INTRODUCTION TO SETS.pptx
INTRODUCTION TO SETS.pptxINTRODUCTION TO SETS.pptx
INTRODUCTION TO SETS.pptx
Sumit366794
 
Set and function.pptx
Set and function.pptxSet and function.pptx
Set and function.pptx
ahsanalmani2
 
Introduction to Set Theory
Introduction to Set TheoryIntroduction to Set Theory
Introduction to Set Theory
Usama ahmad
 
Theory of Computation "Chapter 1, introduction"
Theory of Computation "Chapter 1, introduction"Theory of Computation "Chapter 1, introduction"
Theory of Computation "Chapter 1, introduction"
Ra'Fat Al-Msie'deen
 
1. sets
1. sets1. sets
1. sets
Kanchan Gupta
 
7-Sets-1.ppt
7-Sets-1.ppt7-Sets-1.ppt
7-Sets-1.ppt
jaffarbikat
 
Set concepts
Set conceptsSet concepts
Joy Of Mathematics Ch 1 Sets.pptx
Joy Of Mathematics Ch 1 Sets.pptxJoy Of Mathematics Ch 1 Sets.pptx
Joy Of Mathematics Ch 1 Sets.pptx
SelvaPooraniJeyaseka
 
maths
mathsmaths
SetTheory.ppt
SetTheory.pptSetTheory.ppt
SetTheory.ppt
bryanchristianbrione1
 
SetTheory.ppt
SetTheory.pptSetTheory.ppt
SetTheory.ppt
sanjeevnandwani
 
Introduction to set theory with application
Introduction to set theory with applicationIntroduction to set theory with application
Introduction to set theory with application
Okunlola Oluyemi Adewole
 

Similar to Discrete Structure Mathematics lecture 1 (20)

Discrete Math Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, ...
Discrete Math Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, ...Discrete Math Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, ...
Discrete Math Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, ...
 
set an introduction.pptx
set an introduction.pptxset an introduction.pptx
set an introduction.pptx
 
Introduction to Sets
Introduction to SetsIntroduction to Sets
Introduction to Sets
 
sets.pptx
sets.pptxsets.pptx
sets.pptx
 
Set theory
Set theorySet theory
Set theory
 
Moazzzim Sir (25.07.23)CSE 1201, Week#3, Lecture#7.pptx
Moazzzim Sir (25.07.23)CSE 1201, Week#3, Lecture#7.pptxMoazzzim Sir (25.07.23)CSE 1201, Week#3, Lecture#7.pptx
Moazzzim Sir (25.07.23)CSE 1201, Week#3, Lecture#7.pptx
 
Blackbox task 2
Blackbox task 2Blackbox task 2
Blackbox task 2
 
Set theory
Set theorySet theory
Set theory
 
INTRODUCTION TO SETS.pptx
INTRODUCTION TO SETS.pptxINTRODUCTION TO SETS.pptx
INTRODUCTION TO SETS.pptx
 
Set and function.pptx
Set and function.pptxSet and function.pptx
Set and function.pptx
 
Introduction to Set Theory
Introduction to Set TheoryIntroduction to Set Theory
Introduction to Set Theory
 
Theory of Computation "Chapter 1, introduction"
Theory of Computation "Chapter 1, introduction"Theory of Computation "Chapter 1, introduction"
Theory of Computation "Chapter 1, introduction"
 
1. sets
1. sets1. sets
1. sets
 
7-Sets-1.ppt
7-Sets-1.ppt7-Sets-1.ppt
7-Sets-1.ppt
 
Set concepts
Set conceptsSet concepts
Set concepts
 
Joy Of Mathematics Ch 1 Sets.pptx
Joy Of Mathematics Ch 1 Sets.pptxJoy Of Mathematics Ch 1 Sets.pptx
Joy Of Mathematics Ch 1 Sets.pptx
 
maths
mathsmaths
maths
 
SetTheory.ppt
SetTheory.pptSetTheory.ppt
SetTheory.ppt
 
SetTheory.ppt
SetTheory.pptSetTheory.ppt
SetTheory.ppt
 
Introduction to set theory with application
Introduction to set theory with applicationIntroduction to set theory with application
Introduction to set theory with application
 

More from Amr Rashed

introduction to embedded system presentation
introduction to embedded system presentationintroduction to embedded system presentation
introduction to embedded system presentation
Amr Rashed
 
Discrete Math Ch5 counting + proofs
Discrete Math Ch5 counting + proofsDiscrete Math Ch5 counting + proofs
Discrete Math Ch5 counting + proofs
Amr Rashed
 
Discrete Math Chapter: 8 Relations
Discrete Math Chapter: 8 RelationsDiscrete Math Chapter: 8 Relations
Discrete Math Chapter: 8 Relations
Amr Rashed
 
Discrete Math Chapter 1 :The Foundations: Logic and Proofs
Discrete Math Chapter 1 :The Foundations: Logic and ProofsDiscrete Math Chapter 1 :The Foundations: Logic and Proofs
Discrete Math Chapter 1 :The Foundations: Logic and Proofs
Amr Rashed
 
Introduction to deep learning
Introduction to deep learningIntroduction to deep learning
Introduction to deep learning
Amr Rashed
 
Implementation of DNA sequence alignment algorithms using Fpga ,ML,and CNN
Implementation of DNA sequence alignment algorithms  using Fpga ,ML,and CNNImplementation of DNA sequence alignment algorithms  using Fpga ,ML,and CNN
Implementation of DNA sequence alignment algorithms using Fpga ,ML,and CNN
Amr Rashed
 
امن نظم المعلومات وامن الشبكات
امن نظم المعلومات وامن الشبكاتامن نظم المعلومات وامن الشبكات
امن نظم المعلومات وامن الشبكات
Amr Rashed
 
Machine learning workshop using Orange datamining framework
Machine learning workshop using Orange datamining frameworkMachine learning workshop using Orange datamining framework
Machine learning workshop using Orange datamining framework
Amr Rashed
 
مقدمة عن الفيجوال بيسك 9-2019
مقدمة عن الفيجوال بيسك  9-2019مقدمة عن الفيجوال بيسك  9-2019
مقدمة عن الفيجوال بيسك 9-2019
Amr Rashed
 
Deep learning tutorial 9/2019
Deep learning tutorial 9/2019Deep learning tutorial 9/2019
Deep learning tutorial 9/2019
Amr Rashed
 
Deep Learning Tutorial
Deep Learning TutorialDeep Learning Tutorial
Deep Learning Tutorial
Amr Rashed
 
Matlab plotting
Matlab plottingMatlab plotting
Matlab plotting
Amr Rashed
 
License Plate Recognition
License Plate RecognitionLicense Plate Recognition
License Plate Recognition
Amr Rashed
 
Introduction to FPGA, VHDL
Introduction to FPGA, VHDL  Introduction to FPGA, VHDL
Introduction to FPGA, VHDL
Amr Rashed
 
Introduction to Matlab
Introduction to MatlabIntroduction to Matlab
Introduction to Matlab
Amr Rashed
 
Digital image processing using matlab
Digital image processing using matlab Digital image processing using matlab
Digital image processing using matlab
Amr Rashed
 

More from Amr Rashed (16)

introduction to embedded system presentation
introduction to embedded system presentationintroduction to embedded system presentation
introduction to embedded system presentation
 
Discrete Math Ch5 counting + proofs
Discrete Math Ch5 counting + proofsDiscrete Math Ch5 counting + proofs
Discrete Math Ch5 counting + proofs
 
Discrete Math Chapter: 8 Relations
Discrete Math Chapter: 8 RelationsDiscrete Math Chapter: 8 Relations
Discrete Math Chapter: 8 Relations
 
Discrete Math Chapter 1 :The Foundations: Logic and Proofs
Discrete Math Chapter 1 :The Foundations: Logic and ProofsDiscrete Math Chapter 1 :The Foundations: Logic and Proofs
Discrete Math Chapter 1 :The Foundations: Logic and Proofs
 
Introduction to deep learning
Introduction to deep learningIntroduction to deep learning
Introduction to deep learning
 
Implementation of DNA sequence alignment algorithms using Fpga ,ML,and CNN
Implementation of DNA sequence alignment algorithms  using Fpga ,ML,and CNNImplementation of DNA sequence alignment algorithms  using Fpga ,ML,and CNN
Implementation of DNA sequence alignment algorithms using Fpga ,ML,and CNN
 
امن نظم المعلومات وامن الشبكات
امن نظم المعلومات وامن الشبكاتامن نظم المعلومات وامن الشبكات
امن نظم المعلومات وامن الشبكات
 
Machine learning workshop using Orange datamining framework
Machine learning workshop using Orange datamining frameworkMachine learning workshop using Orange datamining framework
Machine learning workshop using Orange datamining framework
 
مقدمة عن الفيجوال بيسك 9-2019
مقدمة عن الفيجوال بيسك  9-2019مقدمة عن الفيجوال بيسك  9-2019
مقدمة عن الفيجوال بيسك 9-2019
 
Deep learning tutorial 9/2019
Deep learning tutorial 9/2019Deep learning tutorial 9/2019
Deep learning tutorial 9/2019
 
Deep Learning Tutorial
Deep Learning TutorialDeep Learning Tutorial
Deep Learning Tutorial
 
Matlab plotting
Matlab plottingMatlab plotting
Matlab plotting
 
License Plate Recognition
License Plate RecognitionLicense Plate Recognition
License Plate Recognition
 
Introduction to FPGA, VHDL
Introduction to FPGA, VHDL  Introduction to FPGA, VHDL
Introduction to FPGA, VHDL
 
Introduction to Matlab
Introduction to MatlabIntroduction to Matlab
Introduction to Matlab
 
Digital image processing using matlab
Digital image processing using matlab Digital image processing using matlab
Digital image processing using matlab
 

Recently uploaded

学校原版美国波士顿大学毕业证学历学位证书原版一模一样
学校原版美国波士顿大学毕业证学历学位证书原版一模一样学校原版美国波士顿大学毕业证学历学位证书原版一模一样
学校原版美国波士顿大学毕业证学历学位证书原版一模一样
171ticu
 
Manufacturing Process of molasses based distillery ppt.pptx
Manufacturing Process of molasses based distillery ppt.pptxManufacturing Process of molasses based distillery ppt.pptx
Manufacturing Process of molasses based distillery ppt.pptx
Madan Karki
 
Engine Lubrication performance System.pdf
Engine Lubrication performance System.pdfEngine Lubrication performance System.pdf
Engine Lubrication performance System.pdf
mamamaam477
 
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...
gerogepatton
 
CSM Cloud Service Management Presentarion
CSM Cloud Service Management PresentarionCSM Cloud Service Management Presentarion
CSM Cloud Service Management Presentarion
rpskprasana
 
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTCHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
jpsjournal1
 
哪里办理(csu毕业证书)查尔斯特大学毕业证硕士学历原版一模一样
哪里办理(csu毕业证书)查尔斯特大学毕业证硕士学历原版一模一样哪里办理(csu毕业证书)查尔斯特大学毕业证硕士学历原版一模一样
哪里办理(csu毕业证书)查尔斯特大学毕业证硕士学历原版一模一样
insn4465
 
132/33KV substation case study Presentation
132/33KV substation case study Presentation132/33KV substation case study Presentation
132/33KV substation case study Presentation
kandramariana6
 
ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024
Rahul
 
A review on techniques and modelling methodologies used for checking electrom...
A review on techniques and modelling methodologies used for checking electrom...A review on techniques and modelling methodologies used for checking electrom...
A review on techniques and modelling methodologies used for checking electrom...
nooriasukmaningtyas
 
The Python for beginners. This is an advance computer language.
The Python for beginners. This is an advance computer language.The Python for beginners. This is an advance computer language.
The Python for beginners. This is an advance computer language.
sachin chaurasia
 
ML Based Model for NIDS MSc Updated Presentation.v2.pptx
ML Based Model for NIDS MSc Updated Presentation.v2.pptxML Based Model for NIDS MSc Updated Presentation.v2.pptx
ML Based Model for NIDS MSc Updated Presentation.v2.pptx
JamalHussainArman
 
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesHarnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Christina Lin
 
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
Yasser Mahgoub
 
Properties Railway Sleepers and Test.pptx
Properties Railway Sleepers and Test.pptxProperties Railway Sleepers and Test.pptx
Properties Railway Sleepers and Test.pptx
MDSABBIROJJAMANPAYEL
 
ISPM 15 Heat Treated Wood Stamps and why your shipping must have one
ISPM 15 Heat Treated Wood Stamps and why your shipping must have oneISPM 15 Heat Treated Wood Stamps and why your shipping must have one
ISPM 15 Heat Treated Wood Stamps and why your shipping must have one
Las Vegas Warehouse
 
Textile Chemical Processing and Dyeing.pdf
Textile Chemical Processing and Dyeing.pdfTextile Chemical Processing and Dyeing.pdf
Textile Chemical Processing and Dyeing.pdf
NazakatAliKhoso2
 
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
IJECEIAES
 
New techniques for characterising damage in rock slopes.pdf
New techniques for characterising damage in rock slopes.pdfNew techniques for characterising damage in rock slopes.pdf
New techniques for characterising damage in rock slopes.pdf
wisnuprabawa3
 
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Sinan KOZAK
 

Recently uploaded (20)

学校原版美国波士顿大学毕业证学历学位证书原版一模一样
学校原版美国波士顿大学毕业证学历学位证书原版一模一样学校原版美国波士顿大学毕业证学历学位证书原版一模一样
学校原版美国波士顿大学毕业证学历学位证书原版一模一样
 
Manufacturing Process of molasses based distillery ppt.pptx
Manufacturing Process of molasses based distillery ppt.pptxManufacturing Process of molasses based distillery ppt.pptx
Manufacturing Process of molasses based distillery ppt.pptx
 
Engine Lubrication performance System.pdf
Engine Lubrication performance System.pdfEngine Lubrication performance System.pdf
Engine Lubrication performance System.pdf
 
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...
 
CSM Cloud Service Management Presentarion
CSM Cloud Service Management PresentarionCSM Cloud Service Management Presentarion
CSM Cloud Service Management Presentarion
 
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTCHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
 
哪里办理(csu毕业证书)查尔斯特大学毕业证硕士学历原版一模一样
哪里办理(csu毕业证书)查尔斯特大学毕业证硕士学历原版一模一样哪里办理(csu毕业证书)查尔斯特大学毕业证硕士学历原版一模一样
哪里办理(csu毕业证书)查尔斯特大学毕业证硕士学历原版一模一样
 
132/33KV substation case study Presentation
132/33KV substation case study Presentation132/33KV substation case study Presentation
132/33KV substation case study Presentation
 
ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024ACEP Magazine edition 4th launched on 05.06.2024
ACEP Magazine edition 4th launched on 05.06.2024
 
A review on techniques and modelling methodologies used for checking electrom...
A review on techniques and modelling methodologies used for checking electrom...A review on techniques and modelling methodologies used for checking electrom...
A review on techniques and modelling methodologies used for checking electrom...
 
The Python for beginners. This is an advance computer language.
The Python for beginners. This is an advance computer language.The Python for beginners. This is an advance computer language.
The Python for beginners. This is an advance computer language.
 
ML Based Model for NIDS MSc Updated Presentation.v2.pptx
ML Based Model for NIDS MSc Updated Presentation.v2.pptxML Based Model for NIDS MSc Updated Presentation.v2.pptx
ML Based Model for NIDS MSc Updated Presentation.v2.pptx
 
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesHarnessing WebAssembly for Real-time Stateless Streaming Pipelines
Harnessing WebAssembly for Real-time Stateless Streaming Pipelines
 
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
 
Properties Railway Sleepers and Test.pptx
Properties Railway Sleepers and Test.pptxProperties Railway Sleepers and Test.pptx
Properties Railway Sleepers and Test.pptx
 
ISPM 15 Heat Treated Wood Stamps and why your shipping must have one
ISPM 15 Heat Treated Wood Stamps and why your shipping must have oneISPM 15 Heat Treated Wood Stamps and why your shipping must have one
ISPM 15 Heat Treated Wood Stamps and why your shipping must have one
 
Textile Chemical Processing and Dyeing.pdf
Textile Chemical Processing and Dyeing.pdfTextile Chemical Processing and Dyeing.pdf
Textile Chemical Processing and Dyeing.pdf
 
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
 
New techniques for characterising damage in rock slopes.pdf
New techniques for characterising damage in rock slopes.pdfNew techniques for characterising damage in rock slopes.pdf
New techniques for characterising damage in rock slopes.pdf
 
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
 

Discrete Structure Mathematics lecture 1

  • 1. Discrete Structure Mathematics Course: Discrete Structures (501215-3) Prepared by : DR. AMR RASHED PhD in Electronics & Communication Engineering
  • 2. References 1-Rosen, Kenneth H. "Discrete Mathematics and Its Applications.“ seventh edition 2-introduction to set theory 3-rational numbers 4-Introduction to rational and irrational numbers 5-Classification of Numbers 6-SUBSETS AND POWER SETS
  • 3. Course Content: Chapter 2: Basic Structures: Sets, Functions, Sequences, Sums, and Matrices Chapter 8: Advanced Counting Techniques Chapter 1: The Foundations: Logic and Proofs Chapter 4: Number Theory and Cryptography Chapter 5: Induction and Recursion Chapter 6: Counting
  • 4. Chapter 2 Basic Structures: Sets, Functions, Sequences, and Sums
  • 5. Contents 2.1 Sets 2.2 Set Operations 2.3 Functions 2.4 Sequences and Summations
  • 6. Set Theory • Definition 1: A set is an unordered collection of objects • A={1,2,3} • Definition 2: Objects in a set are called elements, or members of the set. • We write a  A to denote that a is an element of the set A. • we write a  A to denote that a is not an element of the set A. • It is common for sets to be denoted using uppercase letters. • Lowercase letters are usually used to denote elements of sets. • There are several ways to describe a set. One way is to list all the members of a set, when this is possible. We use a notation where all members of the set are listed between braces. For example, the notation {a, b, c, d} represents the set with the four elements a, b, c, and d. This way of describing a set is known as the roster method. .1 .2 .3 Visual List Notation
  • 7. • The set V of all vowels in the English alphabet can be written as • V = {a, e, i, o, u} • The set O of odd positive integers less than 10 can be expressed by • O = {1, 3, 5, 7, 9} • Although sets are usually used to group together elements with common properties, there is nothing that prevents a set from having seemingly unrelated elements. For instance, {a, 2, Fred, New Jersey} is the set containing the four elements a, 2, Fred, and New Jersey. • Sometimes the roster method is used to describe a set without listing all its members. Some members of the set are listed, and then ellipses (. . .) are used when the general pattern of three elements is obvious. • The set of positive integers less than 100 can be denoted by {1, 2, 3, . . . , 99}.
  • 8. Set builder notation • Another way to describe a set is to use set builder notation. We characterize all those elements in the set by stating the property or properties they must have to be members. For instance, the set O of all odd positive integers less than 10 can be written as • O = {x|x is an odd positive integer less than 10} or O = {x ℤ +|x is odd and x<10} • Q={…, 1 1 , 1 2 , 1 3 ,…} ={ 𝑚 𝑛 | m, n ∈ ℤ n≠ 0} • Even integers: • 2 ℤ={…,-4,-2,0,2,4,…}={2n | n ∈ ℤ}
  • 9. Additional points • Sets can be finite or infinite • A={1, 2, 3, 4, 5, 6} • Z+ = 1, 2, 3, 4, … all positive integers • Repeated elements are listed once • {a, b, a, c, b, a, c}={a, b, c} • There is no order in a set • {3,2,1}={1,2,3}={2,1,3} .a .b .c
  • 10. Number systems • N={1, 2, 3, …}, or {0,1,2,3,…}natural numbers or counting numbers • W={0,1,2,3,…},whole numbers • Z={…,-2, -1, 0, 1, 2, …}, integers • Z+={1, 2, 3, …}, positive integers, zero is neither positive nor negative • Q={p/q|pZ, qZ, and q0}, rational numbers (fraction numbers and decimals numbers) • Q+={xR|x=p/q, for positive integers p and q} • C, the set of complex numbers. • R, real numbers, i = −1 is not real number • R+, the set of positive real numbers • Terminating decimal numbers (finite) and recurring decimal numbers( infinite and repeating) • Irrational number never terminate and never repeated, there is only one irrational number between any two rational numbers. • To get irrational numbers (square ,sum with irrational (rational+irr) , prod with irrational (rational *irr))
  • 11.
  • 12. Rational numbers • Rational numbers= 𝑃 𝑄 p,q are integers , q≠ 0 • 3= 9 3 = 3 1 also 2.5= 25 10 = 5 2 • Terminating decimal (finite) • 2.5, 3.1, 4.65 • Recurring decimal (infinite and repeating) • 2 3 = 0.666 = 0.6 • 1 6 = 0.1666 = 0.16 • Test : 37 250 = 37 5∗5∗2∗5
  • 14.
  • 15. Intervals • Recall the notation for intervals of real numbers. When a and b are real numbers with a < b, we write • [a, b] = {x | a ≤ x ≤ b} closed interval • [a, b) = {x | a ≤ x < b} • (a, b] = {x |a < x ≤ b} • (a, b) = {x |a < x < b} open interval
  • 16. Example • The set {N,Z,Q,R} is a set containing four elements, each of which is a set. The four elements of this set are N, the set of natural numbers; Z, the set of integers; Q, the set of rational numbers; and R, the set of real numbers. • Remark: Note that the concept of a datatype, or type, in computer science is built upon the concept of a set. In particular, a datatype or type is the name of a set, together with a set of operations that can be performed on objects from that set. For example, boolean is the name of the set {0, 1} together with operators on one or more elements of this set, such as AND, OR, and NOT.
  • 17. Definition 3 • Definition 3: Two sets are equal if and only if they have the same elements. A=B if x(x  A  x  B) • {1, 3, 5} and {3, 5, 1} are equal • The sets {1, 3, 5} and {3, 5, 1} are equal, because they have the same elements. Note that the order in which the elements of a set are listed does not matter. Note also that it does not matter if an element of a set is listed more than once, so {1, 3, 3, 3, 5, 5, 5, 5} is the same as the set {1, 3, 5} because they have the same elements.
  • 18. The Empty set • Empty set (null set):  (or {}) • There is a special set that has no elements. This set is called the empty set or null set, and is denoted by ∅. The empty set can also be denoted by { } (that is, we represent the empty set with a pair of braces that encloses all the elements in this set). Often, a set of elements with certain properties turns out to be the null set. For instance, the set of all positive integers that are greater than their squares is the null set. • A set with one element is called a singleton set. A common error is to confuse the empty set ∅ with the set {∅}, which is a singleton set. The single element of the set {∅} is the empty set itself ! A useful analogy for remembering this difference is to think of folders in a computer file system. The empty set can be thought of as an empty folder and the set consisting of just the empty set can be thought of as a folder with exactly one folder inside, namely, the empty folder.
  • 19. Venn diagram • Venn diagram to graphically represent sets • Universal set U: rectangle • Sets: circles • Elements of a set: point FIGURE 1 Venn Diagram for the Set of Vowels.
  • 20. Subsets • Definition 4: The set A is a subset of B if and only if every element of A is also an element of B. A  B if x(x  A  x  B) • Theorem 1: For every set S, (1)   S and (2) S  S. • Proper subset: A is a proper subset of B, we note A  B, if x(x  A  x  B)  x(x  B  x  A)
  • 21.
  • 22. Subsets • If AB and BA, then A=B • Sets may have other sets as members • A={, {a}, {b}, {a,b}} B={x|x is a subset of the set {a,b}} • A=B FIGURE 2 Venn Diagram Showing that A Is a Subset of B.
  • 23. The Size of a Set • Definition 5: If there are exactly n distinct members in the set S (n is a nonnegative integer), we say that S is a finite set and that n is the cardinality of S. • |S|= n • ||=0 , |{}|=1 ,|{ }|=0 • Definition 6: a set is infinite if it’s not finite. • Z+
  • 24. Elements and cardinality • Let C={yellow, blue, red} • Yellow is an element of C ,yellow∈ 𝐶 • Green is not an element of C, Green ∉ 𝐶 • The cardinality (size) of C is 3 ,|c|=3
  • 25. Exercise • List the elements of D. D={x ∈ ℤ+ | x<6} • 1,2,3,4,5 • What is the cardinality of D? • |D|=5 • What is the cardinality of {,{a,b}} • 2 • What is the cardinality of {,{a},{b}} • 3 • What is the cardinality of {,a,{b}} • 3