Scribd
Upload
1K views

Discrete Mathematics and Its Applications: Sixth Edition

This document provides an overview of an introductory course in discrete mathematics. The course aims to introduce students to logical thinking and techniques used in information technology. Over the course, students will learn topics like propositional logic, sets, functions, algorithms, graph theory, and number theory. The goals are for students to understand mathematical arguments, construct proofs, develop recursive algorithms, and apply discrete math concepts to problem solving.

Uploaded by

Sidra chaudhary
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
1K views

Discrete Mathematics and Its Applications: Sixth Edition

This document provides an overview of an introductory course in discrete mathematics. The course aims to introduce students to logical thinking and techniques used in information technology. Over the course, students will learn topics like propositional logic, sets, functions, algorithms, graph theory, and number theory. The goals are for students to understand mathematical arguments, construct proofs, develop recursive algorithms, and apply discrete math concepts to problem solving.

Uploaded by

Sidra chaudhary
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

Discrete Mathematics

and Its Applications


Sixth Edition
By Kenneth Rosen

Introduction

歐亞書局
Aims & Objectives
This is an introductory course in discrete
mathematics. The goal of this course is to
introduce students to ideas and techniques from
discrete mathematics that are widely used in
information technology. This course teaches the
students techniques in how to think logically
and mathematically and apply these techniques
in solving problems. To achieve this goal,
students will learn logic and proof, sets,
functions, as well as algorithms and
mathematical reasoning.
Course Contents
• Propositional logic; Predicates and quantifiers;
Rules of inference; Sets and functions;
• Cardinality of sets; Matrices; Algorithms and
their complexity; Introduction to number
theory. Induction and recursion.
• Counting: The basics of counting; The
pigeonhole principle; Permutations and
combinations.
• Modeling computation: Automata and regular
expressions; Finite-state machines with output.
Course Contents Contd…
• Graphs: Graph terminology and special types
of graphs; Representing graphs and graph
isomorphism;
• Connectivity; Euler and Hamilton paths;
• Trees: Applications of trees; Tree traversal;
Spanning trees.
• Number theory; Modular arithmetic.
• Advance topics in discrete mathematics
Goals
• Understand and construct mathematical
arguments
• Prove simple arguments
• Develop recursive algorithms based on
mathematical induction
• Know basic properties of relations
• Know essential concepts in graph theory and
related algorithms
• Apply knowledge about discrete mathematics
in problem solving
Discrete Mathematics
and Its Applications
Sixth Edition
By Kenneth Rosen

Chapter 1
The Foundations:
Logic and Proofs

歐亞書局
1.1 Propositional Logic
1.2 Propositional Equivalences
1.3 Predicates and Quantifiers
1.4 Nested Quantifiers
1.5 Rules of Inference
1.6 Introduction to Proofs
1.7 Proof Methods and Strategy

歐亞書局 P. 1
1.1 Propositional Logic

• Logic: to give precise meaning to


mathematical statements
• Proposition: a declarative sentence that is
either true or false, but not both
– 1+1=2
– Toronto is the capital of Canada
• Propositional variables: p, q, r, s
• Truth value: true (T) or false (F)
• Compound propositions: news
propositions formed from existing
propositions using logical operators
• Definition 1: Let p be a proposition. The
negation of p, denoted by p (orp), is the
statement “It is not the case that p.”
– “not p”
TABLE 1 (1.1)

歐亞書局 P. 3
• Definition 2: Let p and q be propositions.
The conjunction of p and q, denoted by p 
q, is the proposition “p and q.”
• Definition 3: Let p and q be propositions.
The disjunction of p and q, denoted by p 
q, is the proposition “p or q.”
TABLE 2 (1.1)

歐亞書局 P. 4
TABLE 3 (1.1)

歐亞書局 P. 4
• Definition 4: Let p and q be propositions.
The exclusive or of p and q, denoted by p 
q, is the proposition that is true when
exactly one of p and q is true and is false
otherwise.
TABLE 4 (1.1)

歐亞書局 P. 6
Conditional Statements

• Definition 5: Let p and q be propositions.


The conditional statement p  q is the
proposition “if p, then q.”
– p: hypothesis (or antecedent or premise)
– q: conclusion (or consequence)
– Implication
• “p implies q”
• Many ways to express this…
TABLE 5 (1.1)

歐亞書局 P. 6

You might also like