19MAT115 Discrete Mathematics 3104

Course Outcomes

CO1 Understand the basic concepts of Mathematical reasoning and basic counting
techniques. Also understand the different types of proves like mathematical
induction.
CO2 Understand the concepts of various types of relations, partial ordering and
equivalence relations.
CO3 Apply the concepts of generating functions to solve the recurrence relations.
CO4 Apply the concepts of divide and conquer method and principle of inclusion and
exclusion to solve some simple algorithms in discrete mathematics.
CO5 Understand various definitions in number theory and study their properties.

Phase I

Logic, Mathematical Reasoning and Counting: Logic, Prepositional Equivalence,

Predicate and Quantifiers, Theorem Proving, Functions, Mathematical Induction. Recursive
Definitions, Recursive Algorithms, Basics of Counting, Pigeonhole Principle, Permutation
and Combinations. (Sections: 1.1 -1.3, 1.5 -1.7, 2.3, 4.1 - 4.4, 5.1 - 5.3 and 5.5)

Phase II

Relations and Their Properties: Representing Relations, Closure of Relations, Partial

Ordering, Equivalence Relations and partitions. (Sections: 7.1, 7.3 - 7.6)

Advanced Counting Techniques and Relations: Recurrence Relations, Solving

Recurrence Relations, Generating Functions, Solutions of Homogeneous Recurrence
Relations, Divide and Conquer Relations, Inclusion-Exclusion. (Sections: 6.1 - 6.6)

Phase III

Number Theory: Divisibility and Factorization. Congruences. Simultaneous linear

congruences, Chinese Remainder Theorem. Wilson's Theorem, Fermat's Theorem,
pseudoprimes and Carmichael numbers, Euler's Theorem

Arithmetic functions and Quadratic residues:

TEXTBOOKS:

1. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Tata McGraw-

Hill Publishing Company Limited, New Delhi, Sixth Edition, 2007.

2. James Strayer, “Elementary Number Theory”, Waveland Press, 2002.

REFERENCES:

1. R.P. Grimaldi, “Discrete and Combinatorial Mathematics”, Pearson Education, Fifth

Edition, 2007.
2. Thomas Koshy, “Discrete Mathematics with Applications”, Academic Press, 2005.
3. Liu, “Elements of Discrete Mathematics”, Tata McGraw- Hill Publishing Company
Limited , 2004.
 Lecture Plan

Book-1: Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Tata

McGraw- Hill Publishing Company Limited, New Delhi, Seventh Edition, 2017.

Book-2: James Strayer, “Elementary Number Theory”, Waveland Press, 2002.

Lecture Section Topics

Book-1 Logic, Prepositions & connectives, Inverse, Converse,
L1
1.1 Contrapositive of implication.
L2 1.1 Truth tables, Tautology & Contradiction using truth tables
L3 1.2 Logical Equivalences, Laws of logic
L4 1.2 Translating English sentences – Propositional Equivalence
L5 1.3 Introduction to Quantifiers and use of Quantifiers.
L6 1.3 Problems involving Quantifiers.
L7 1.5 Rules of inference.
L8 1.5 Rules of inference for Quantified Statements-Problems.
L9 1.6 Introduction to proofs: Concept of Direct & Indirect proofs
L10 1.6 Proofs by contradiction and proofs of equivalence
L11 Tutorial
L12 4.1 Mathematical Induction
L13 4.2 Strong Induction : Examples 1-4 & Exercises1-8.
Recursive Definition–Recursively defined functions (Example 1-5)
L14 4.3
and Exercise 1-25.
L15 4.4 Recursive Algorithms for n!, an , bn(mod m), gcd(a,b)
L16 5.1 Basics of Counting- Product Rule and Sum Rule.
L17 5.2 Pigeon hole principle – problems.
L18 5.3 Permutation, Combination and problems.
L19 Tutorial
Recurrence relation: Definitions and modeling. Rabbits of
L20 6.1
Fibonacci numbers, Tower of Hanoi and codeword enumeration.
Solving Linear homogeneous recurrence relations with constant
L21 6.1
coefficients.
L22 6.2 Non-homogeneous recurrence relations with constant coefficients
L23 6.2 Problems.
Method of generating functions for solving homogeneous
L24 6.4 recurrence relations.
L25 6.4 Problems.
L26 6.3 Divide and Conquer Algorithms, Problems
Inclusion and Exclusion Principle, problems.
L27 6.5
L28 Tutorial
L29 7.1 Definition- Cartesian Product, Relation, Relation on a set.
L30 7.1 Properties of relations, Combining relations.
Representing relations using matrices and digraphs, matrices for
L31 7.3
union, intersection.
L32 7.3 Composition, transposition, inversion and complementation.
 L33 7.4 Three types of closures , Theorems (Only Statement)
L34 7.4 Warshall’s Algorithm
L35 7.5 Equivalence Relations, equivalence classes.
L36 7.5 Partitions and theorems 1 and 2 (with proof).
Definitions1,2,3,4 & Examples, Lexicographic ordering, Hasse
L37 7.6
Diagram
L38 7.6 Maximal and Minimal elements
L39 Tutorial
Book -2
L40 Divisibility. Theorem 1.4 Division Algorithm (with proof)
1.1
L41 1.1 Divisibility problems
L42 1.2 Prime numbers. Examples only
L43 1.3 GCD
Fundamental Theorem of Arithmetic. Lemma 1.14 and Theorem
L44 1.5
1.16 (with proof)
L45 1.5 Problems
L46 2.1 Congruences. Definition and examples
L47 2.2 Linear Congruence-examples
L48 2.3 Chinese Remainder theorem (with proof)
L49 2.3 Problems
L50 2.4 Wilson’s theorem-problems
L51 2.5 Fermat’s little theorem-problems
L52 2.6 Euler’s theorem-problems
L53 3.1 Arithmetic functions-problems
L54 3.2 Euler Phi-function-problem.
L55 Tutorial

COURSE EVALUATION PATTERN:

Continuous Assesment – 20 marks (Quizzes / assignments)

Test – 1 – 15 marks (two hour test)

Test – 2 – 15 marks (two-hour test)

End semester – 50 marks.

Total – 100 marks.

 Supplementary exam for this course will be conducted as a three-hour test for 50
marks.