![Page 1: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/1.jpg)
Discrete Mathematics
Lecture # 1
![Page 2: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/2.jpg)
Course Objectives Express statements with the precision of
formal logic. Analyze arguments to test their validity. Apply the basic properties and operations
related to sets. Apply to sets the basic properties and
operations related to relations and function. Define terms recursively. Prove a formula using mathematical
induction
![Page 3: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/3.jpg)
Course Objectives Prove statements using direct and indirect
methods. Compute probability of simple and conditional
events. Identify and use the formulas of combinatorics
in different problems. Illustrate the basic definitions of graph theory
and properties of graphs. Relate each major topic in Discrete Mathematics
to an application area in computing
![Page 4: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/4.jpg)
Recommended Book Discrete Mathematics with Applications
(fourth edition or later) by Susanna S. Epp
![Page 5: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/5.jpg)
Main Topics1. Logic2. Sets & Operations on sets3. Relations & Their Properties4. Functions5. Sequences & Series6. Recurrence Relations7. Mathematical Induction8. Loop Invariants9. Combinatorics10. Probability11. Graphs and Trees
![Page 6: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/6.jpg)
Marks Distribution1. Pre-Mid
Assignments 10% Quizzes/Tests 10% Mid Term 25%
2. Post-Mid Assignments 10% Quizzes/Tests 10% Final Term 30%
![Page 7: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/7.jpg)
![Page 8: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/8.jpg)
Set of Integers: • • • • • • 3 -2 -1 0 1 2 Set of Real Numbers: • • • • • • •
-3 -2 -1 0 1 2
![Page 9: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/9.jpg)
What is DM? Discrete Mathematics concerns
processes that consist of a sequence of individual steps.
![Page 10: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/10.jpg)
Logic Logic is the study of the principles and
methods that distinguishes between a valid and an invalid argument.
![Page 11: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/11.jpg)
Statement A statement is a declarative sentence that
is either true or false but not both. A statement is also referred to as a
proposition
![Page 12: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/12.jpg)
Examples
1. Grass is green. 2. 4 + 2 = 63. 4 + 2 = 7 4. There are four fingers in a hand.
![Page 13: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/13.jpg)
Examples
Truth Values1. Grass is green. T2. 4 + 2 = 6 T3. 4 + 2 = 7 F4. There are four fingers in a hand. F
![Page 14: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/14.jpg)
Not Proposition Close the door. x is greater than 2. He is very rich
![Page 15: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/15.jpg)
Rule If the sentence is preceded by other
sentences that make the pronoun or variable reference clear, then the sentence is a statement.
![Page 16: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/16.jpg)
Example x = 1 x > 2x > 2 is a statement with truth-value FALSE.
![Page 17: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/17.jpg)
Example Bill Gates is an American He is very rich He is very rich is a statement with truth-
value TRUE.
![Page 18: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/18.jpg)
Understanding Statements x + 2 is positive. May I come in? Logic is interesting. It is hot today. -1 > 0 x + y = 12
![Page 19: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/19.jpg)
Understanding Statements x + 2 is positive. Not a
statement May I come in? Not a
statement Logic is interesting. A statement It is hot today. A statement 5. -1 > 0 A statement 6. x + y = 12 Not a
statement
![Page 20: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/20.jpg)
Compound Statements Simple statements could be used to build a
compound statement. Examples “3 + 2 = 5” and “Lahore is a city in
Pakistan” “The grass is green” or “ It is hot today” “Discrete Mathematics is not difficult to me”AND, OR, NOT are called LOGICAL CONNECTIVES
![Page 21: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/21.jpg)
Symbolic Representation Statements are symbolically represented by
letters such as p, q, r,... EXAMPLES: p = “Islamabad is the capital of Pakistan” q = “17 is divisible by 3”
![Page 22: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/22.jpg)
Logical Connectives
![Page 23: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/23.jpg)
Examples Statements are symbolically represented by
letters such as p, q, r,... EXAMPLES: p = “Islamabad is the capital of Pakistan” q = “17 is divisible by 3”
![Page 24: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/24.jpg)
Symbolic Representation p = “Islamabad is the capital of Pakistan” q = “17 is divisible by 3” p q = “Islamabad is the capital of Pakistan
and 17 is divisible by 3” p q = “Islamabad is the capital of Pakistan
or 17 is divisible by 3” ~p = “It is not the case that Islamabad is
the capital of Pakistan” or simply “Islamabad is not the capital of Pakistan”
![Page 25: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/25.jpg)
Translating from English to Symbols
Let p = “It is hot”, and q = “It is sunny”
SENTENCE It is not hot. It is hot and sunny. It is hot or sunny. It is not hot but sunny. It is neither hot nor sunny.
![Page 26: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/26.jpg)
Translating from English to Symbols Let p = “It is hot”, and q = “It is sunny”
SENTENCE SYMBOLIC FORM It is not hot. ~ p It is hot and sunny. p q It is hot or sunny. p q It is not hot but sunny. ~ p q It is neither hot nor sunny. ~ p ~ q
![Page 27: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/27.jpg)
Example Let h = “Zia is healthy” w = “Zia is wealthy” s = “Zia is wise”Translate the compound statements to symbolic form:
Zia is healthy and wealthy but not wise. Zia is not wealthy but he is healthy and wise.
Zia is neither healthy, wealthy nor wise.
![Page 28: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/28.jpg)
Example Let h = “Zia is healthy” w = “Zia is wealthy” s = “Zia is wise”Translate the compound statements to symbolic form:
Zia is healthy and wealthy but not wise. (h w) (~s) Zia is not wealthy but he is healthy and wise.~w (h s)
Zia is neither healthy, wealthy nor wise. ~h ~w ~s
![Page 29: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/29.jpg)
Example Let m = “Ali is good in Mathematics” c = “Ali is a Computer Science student”
Translate the following statement forms into plain English:
~ c c m m ~c
![Page 30: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/30.jpg)
Example Let m = “Ali is good in Mathematics” c = “Ali is a Computer Science student”
Translate the following statement forms into plain English:
~ c Ali is not a Computer Science student c m Ali is a Computer Science student or good in Maths. m ~c Ali is good in Maths but not a Computer
Science student
![Page 31: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/31.jpg)
Truth Table A convenient method for analyzing a
compound statement is to make a truth table for it.
A truth table specifies the truth value of a compound proposition for all possible truth values of its constituent propositions.
![Page 32: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/32.jpg)
Negation (~) If p is a statement variable, then negation
of p, “not p”, is denoted as “~p” It has opposite truth value from p i.e., if p is true, ~p is false; if p is false, ~p is true.
![Page 33: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/33.jpg)
Conjunction (^) If p and q are statements, then the conjunction of p
and q is “p and q”, denoted as “p q”. It is true when, and only when, both p and q are
true. If either p or q is false, or if both are false, pq is false.
![Page 34: Discrete Mathematics Lecture # 1. Course Objectives Express statements with the precision of formal logic. Analyze arguments to test their validity](https://reader033.vdocuments.us/reader033/viewer/2022052318/5a4d1b5e7f8b9ab0599ac050/html5/thumbnails/34.jpg)
Disjunction/Inclusive OR(v) If p & q are statements, then the disjunction of p
and q is “p or q”, denoted as “p q”.It is true when at least one of p or q is true and is false only when both p and q are false.