UNIT-1: Introduction and Set Theory, Logic of Compound Statements

●​ Chapter: Set Theory (Properties of Sets, Algebraic Proofs)​

○​ Example 1: State and prove Distributive law of the algebra of sets.

○​ Example 18: Prove that if A⊆B and B⊆C then A⊆C .
○​ Example 34: State and prove Distributive law of the algebra of sets.
○​ Example 49: Prove that by an example PA⊈PB,P(B)⊈P(C) but P(A)⊆P(C).
●​ Chapter: The Logic of Compound Statements (Logical Form and Logical
Equivalence, Tautology)​

○​ Example 2: Construct the truth table of p˅~(p˄q) and also verify whether the
proposition is tautology or not and also verify using truth table
p˅(q˄r)≡(p˅q)˄(p˅r)
○​ Example 17: Verify using truth table p˅(q˄r)≡(p˅q)˄(p˅r) and also construct the
truth table of p˅~(p˄q) and also verify whether the proposition is tautology

UNIT-2: Quantified Statements and Elementary Number Theory and Methods of Proof

●​ Chapter: Quantified Statements (Predicates and Quantified Statements)​

○​ Example 5: Let A = {1, 2, 3, 4, 5}. Determine the truth value of each of the
following statements with specification: (a) (∃x ∈ A)(x + 3 = 10) (b) (∃x ∈ A)(x
+ 3 < 5) (c) (∀x ∈ A)(x + 3 < 10) (d) (∀x ∈ A)(x + 3 ≤ 7) And also negate each
of the following statements: (a) If the teacher is absent, then some students do
not complete their homework. (b) All the students completed their homework and
the teacher is present. (c) Some of the students did not complete their homework
or the teacher is absent.
○​ Example 22: Let A = {1, 2, 3, 4, 5}. Determine the truth value of each of the
following statements with specification: (a) (∃x ∈ A)(x + 3 = 10) (c) (∃x ∈ A)(x
+ 3 < 5) (b) (∀x ∈ A)(x + 3 < 10) (d) (∀x ∈ A)(x + 3 ≤ 7) And also negate each
of the following statements: (a) If the teacher is absent, then some students do
not complete their homework. (b) All the students completed their homework and
the teacher is present. (c) Some of the students did not complete their homework
or the teacher is absent..
○​ Example 38: Let A = {1, 2, 3, 4, 5}. Determine the truth value of each of the
following statements wth specification: (a) (∃x ∈ A)(x + 3 = 10) (c) (∃x ∈ A)(x
+ 3 < 5) (b) (∀x ∈ A)(x + 3 < 10) (d) (∀x ∈ A)(x + 3 ≤ 7) And also negate each
of the following statements: (a) If the teacher is absent, then some students do
not complete their homework. (b) All the students completed their homework and
the teacher is present. (c) Some of the students did not complete their homework
or the teacher is absent.
○​ Example 52: Let B= {2,4,6,8,10}. Determine the truth value of each of the
following statements with specification: (a) (∃x ∈ B)(x - 2 = 9) (c) (∃x ∈ B)(x +
 2 12) (b) (∀x ∈ B)(x - 2 >0)) And also negate each of the following statements:
(a) If the teacher is absent, then some students do not complete their homework.
(b) All the students completed their homework and the teacher is present. (c)
Some of the students did not complete their homework or the teacher is absent.
●​ Chapter: Elementary Number Theory and Methods of Proof (Introduction to Direct
Proofs, Rational Numbers)​

○​ Example 3: Given any two distinct rational number r and s such that r < s then
prove that there exist x such that r <x< s
○​ Example 20: Given any two distinct rational number r and s such that r < s then
prove that there exist x such that <x< s.
○​ Example 36: Given any two distinct rational number r and s such that r < s then
prove that there exist x such that <x< s.
○​ Example 51: Given any two distinct rational number r and s such that r < s then
prove that there exist x such that <x< s.
●​ Chapter: Elementary Number Theory and Methods of Proof (Introduction to Direct
Proofs)​

○​ Example 6: Prove by direct method,‘If n is an odd integer then n3+n is even.’.

○​ Example 21: State Direct method and prove by direct method,‘If n is an odd
integer then n5+n is even.’
○​ Example 37: Prove by direct method,‘If n is an odd integer then n7+n is even.’
○​ Example 53: Prove by direct method,‘If n is an odd integer then n7+n is even.’
●​ Chapter: Elementary Number Theory and Methods of Proof (Indirect Argument:
Contradiction and Contraposition)​

○​ Example 4: Prove by contradiction method √2 is an irrational number.

○​ Example 19: Prove by contradiction method √3 is an irrational number.
○​ Example 35: Prove by contradiction method √5 is an irrational number.
○​ Example 50: Prove by contradiction method √2 is an irrational number.

UNIT-3: Sequences, Mathematical Induction, Recursion, and Functions

●​ Chapter: Sequences, Mathematical Induction, and Recursion (Mathematical

Induction)​

○​ Example 7: Use the identity 1+2+3+…..+n=n(n+1)2 to prove that

13+23+33+…+n3=(1+2+3+…+n)2
○​ Example 24: Prove: 2+4+6+….+2n=n(n+1) by mathematical induction.
○​ Example 40: Use the identity 1+2+3+…..+n=n(n+1)2 to prove that
13+23+33+…+n3=(1+2+3+…+n)2
○​ Example 55: Show that n3-4n+6 is divisible by 3.(By Mathematical Induction)
●​ Chapter: Sequences, Mathematical Induction, and Recursion (Defining sequences
recursively, solving recurrence relations by iteration, Second order linear
homogenous recurrence relations with constant coefficients)
 ○​ Example 8: Find the unique solution of the recurrence relation an=an-1+an-2
where a0=0 and a1=1
○​ Example 23: Find the unique solution of the recurrence relation an=2an-1+3an-2
where a0=1 and a1=2.
○​ Example 39: Find the unique solution of the recurrence relation an=an-1+an-2
where a0=0 and a1=1.
○​ Example 54: Find the unique solution of the recurrence relation an=2an-1+3an-2
where a0=1 and a1=2.
●​ Chapter: Functions (Functions Defined on General Sets, One-to-One and Onto,
Inverse Functions, Composition of Functions)​

○​ Example 9: Check whether function is bijective or not f:R→R, define as fx=2x+1

and also find f-1.
○​ Example 10: Let X = {1, 2, 3, 4}. Determine whether each relation on X is a
function from X into X. (a) f = {(2, 3), (1, 4), (2, 1), (3.2), (4, 4)} (b) g = {(3, 1), (4,
2), (1, 1)} (c) h = {(2, 1), (3, 4), (1, 4), (2, 1), (4, 4)} And also let the functions f: A
→ B, g: B → C, h: C → D be defined by below figure. Determine if each function
is: a)onto, (b) one-to-one, (c) invertible.

○​ Example 25: Check whether function is bijective or not g:R→R, define as

gx=3x-5 and also find g-1.
○​ Example 26: Let X = {1, 2, 3, 4}. Determine whether each relation on X is a
function from X into X. (a) f = {(2, 3), (1, 4), (2, 1), (3.2), (4, 4)} (b) g = {(3, 1), (4,
2), (1, 1)} (c) h = {(2, 1), (3, 4), (1, 4), (2, 1), (4, 4)} And also let the functions f: A
→ B, g: B → C, h: C → D be defined by below figure. Determine if each function
is: a)onto, (b) one-to-one, (c) invertible.

○​ Example 27: Let X = {1, 2, 3, 4}. Determine whether each relation on X is a

function from X into X. (a) f = {(2, 3), (1, 4), (2, 1), (3.2), (4, 4)} (b) g = {(3, 1), (4,
2), (1, 1)} (c) h = {(2, 1), (3, 4), (1, 4), (2, 1), (4, 4)} and Also find the domain D of
each of the following real-valued functions of a real variable fx=1x-2
 ○​ Example 40: Check whether function is bijective or not g:R→R, define as
gx=4x+7 and also find g-1.
○​ Example 43: Let X = {1, 2, 3, 4}. Determine whether each relation on X is a
function from X into X. (a) f = {(2, 3), (1, 4), (2, 1), (3.2), (4, 4)} (b) g = {(3, 1), (4,
2), (1, 1)} (c) h = {(2, 1), (3, 4), (1, 4), (2, 1), (4, 4)} and Also find the domain D of
each of the following real-valued functions of a real variable fx=1x-2
○​ Example 57: Check whether function is bijective or not g:R→R, define as
gx=4x+7 and also find g-1.
○​ Example 58: Let X={a,b,c,d}. Determine whether each of the following relations is
a function from X intoX:(a)f={(a,b),(b,c),(a,d),(c,d),(d,d)} (b)
g={(a,a),(b,b),(c,c),(d,d)}(c) h={(a,b),(b,c),(c,d),(a,d),(d,b)}. Also Also find the
domain D of each of the following real-valued functions of a real variable
fx=1x2-9

UNIT-4: Relations, Graphs, and Trees

●​ Chapter: Relations (Relations on Sets, Reflexivity, Symmetry, and Transitivity,

Equivalence Relations, Partial Order Relations)​

○​ Example 11: Consider the following five relations on the set A = {1, 2, 3, 4}: R1 =
{(1, 1), (1, 2), (2, 3), (1, 3), (4, 4)} R2 = {(1, 1),(1, 2), (2, 1), (2, 2), (3, 3), (4, 4)} R3
= {(1, 3), (2, 1)} R4 = ∅, the empty relation R5 = A × A, the universal
relation.Determine which of the relations are reflexive, symmetric and transitive
with specification.
○​ Example 41: Let A={1,2,3,4,5} and R is a relation on A as follows R=x+y is even
then a)write relation R explicitly.b) Determine if R is Reflexive, Symmetric, and
Transitive.c) Is R an equivalence relation? Why or why not?
○​ Example 56: Let A={1,2,3,4,5} and R is a relation on A as follows R=x+y is even
then a)write relation R explicitly.b) Determine if R is Reflexive, Symmetric, and
Transitive.c) Is R an equivalence relation? Why or why not?
●​ Chapter: Relations (Relations on Sets, Matrix Representations of Graphs,
Composition of Relations)​

○​ Example 13: Given A = {1, 2, 3, 4} and B = {x, y,z}. Let R be the following relation
from A to B,R = {(1, y), (1, z), (3, y), (4, x), (4, z)} (a) Determine the matrix of the
relation. (b) Draw the arrow diagram of R. (c) Find the inverse relation R−1 of R.
(d) Determine the domain and range of R. also Let A = {1, 2, 3}, B = {a, b, c}, and
C = {x, y,z}. Consider the following relations R and S from A to B and from B to C,
respectively. R = {(1, b), (2, a), (2, c)} and S = {(a, y), (b, x), (c, y), (c, z)} then find
the composition relation R◦S.
○​ Example 30: Given A = {1, 2, 3, 4} and B = {x, y,z}. Let R be the following relation
from A to B: R = {(1, y), (1, z), (3, y), (4, x), (4, z)} (a) Determine the matrix of the
relation. (b) Draw the arrow diagram of R. (c) Find the inverse relation R−1 of R.
(d) Determine the domain and range of R. also let A = {1, 2, 3}, B = {a, b, c}, and
C = {x, y,z}. Consider the following relations R and S from A to B and from B to C,
 respectively. R = {(1, b), (2, a), (2, c)} and S = {(a, y), (b, x), (c, y), (c, z)} then find
the composition relation R◦S.
○​ Example 44: Given A = {1, 2, 3, 4} and B = {x, y,z}. Let R be the following relation
from A to B: R = {(1, y), (1, z), (3, y), (4, x), (4, z)} (a) Determine the matrix of the
relation. (b) Draw the arrow diagram of R. (c) Find the inverse relation R−1 of R.
(d) Determine the domain and range of R. also let A = {1, 2, 3}, B = {a, b, c}, and
C = {x, y,z}. Consider the following relations R and S from A to B and from B to C,
respectively. R = {(1, b), (2, a), (2, c)} and S = {(a, y), (b, x), (c, y), (c, z)} then find
the composition relation R◦S.
○​ Example 61: Given A = {1, 2, 3, 4} and B = {x, y,z}. Let R be the following relation
from A to B: R = {(1, y), (1, z), (3, y), (4, x), (4, z)} (a) Determine the matrix of the
relation. (b) Draw the arrow diagram of R. (c) Find the inverse relation R−1 of R.
(d) Determine the domain and range of R. also let A = {1, 2, 3}, B = {a, b, c}, and
C = {x, y,z}. Consider the following relations R and S from A to B and from B to C,
respectively. R = {(1, b), (2, a), (2, c)} and S = {(a, y), (b, x), (c, y), (c, z)} then find
the composition relation R◦S.
●​ Chapter: Graphs and Trees (Definitions and Basic Properties, Simple Graphs,
Degree Sequences)​

○​ Example 12: If possible construct a simple graph with 8 vertices and 29 edges.
○​ Example 14: Does there exists a simple graph with following degree sequence
(1,3,3,4,5,6,6)?
○​ Example 29: Determine whether a simple graph with the following degree
sequence exists:(2,3,3,4,4,5,6)
○​ Example 45: Determine whether a simple graph with the following degree
sequence exists:(2,3,3,4,4,5,6)
○​ Example 59: If possible construct a simple graph with 8 vertices and 29 edges
○​ Example 60: Determine whether a simple graph with the following degree
sequence exists:(2,3,3,4,4,5,6)
●​ Chapter: Graphs and Trees (Definitions and Basic Properties, Planar Graphs)​

○​ Example 28: In a connected Planar graph,there are 15 vertices each of degree

2,find the number of regions.
○​ Example 42: In a connected Planar graph,there are 15 vertices each of degree
2,find the number of regions

UNIT-5: Counting and Probability

●​ Chapter: Counting (Introduction, Possibility Trees and the Multiplication Rule)​

○​ Example 15: There are four bus lines between A and B, and three bus lines
between B and C. Find the number m of ways that a man can travel by bus: (a)
from A to C by way of B; (b) roundtrip from A to C by way of B; (c) roundtrip from
A to C by way of B but without using a bus line more than once. Also find (a) P
(7, 3); (b) P (14, 2)
 ○​
●​ Chapter: Counting (The Pigeonhole Principle)​

○​ Example 16: Using Pigeon-hole Principle, find the minimum number n of integers
to be selected from S={1,2,3,…,9} so that: (a) The sum of two of the n integers is
even. (b) The difference of two of the n integers is 5
○​ Example 31: Using Pigeon-hole Principle, find the minimum number n of integers
to be selected from S={1,2,3,…,9} so that: (a) The sum of two of the n integers is
even. (b) The difference of two of the n integers is 5
○​ Example 46: Using Pigeon-hole Principle,find the minimum number n of integers
to be selected from S where S={1,2,3,…,12} so that:(a) The sum of two of the
selected numbers is divisible by 3.(b) The difference of two of the selected
numbers is 7.
○​ Example 63: Using Pigeon-hole Principle,find the minimum number n of integers
to be selected from S where S={1,2,3,…,12} so that:(a) The sum of two of the
selected numbers is divisible by 3.(b) The difference of two of the selected
numbers is 7.
●​ Chapter: Counting (Counting Subsets of a Set: Combinations)​

○​ Example 32: A class contains 10 students with 6 men and 4 women. Find the
number n of ways to: (a) Select a 4-member committee from the students. (b)
Select a 4-member committee with 2 men and 2 women. (c) Elect a president,
vice president, and treasurer.
○​
○​ Example 47: A rotary club consists of 12 members, with 7 men and 5 women.
Find the number n of ways to:(a) Select a 5-member committee from the club
members.(b) Select a 5-member committee with 3 men and 2 women. (c) Elect a
president, secretary, and treasurer from the club
○​ Example 62: A class contains 10 students with 6 men and 4 women. Find the
number n of ways to: (a) Select a 4-member committee from the students. (b)
Select a 4-member committee with 2 men and 2 women. (c) Elect a president,
vice president, and treasurer.
○​
●​ Chapter: Counting (Counting Elements of Disjoint Sets: The Addition Rule,
Inclusion-Exclusion Principle - implicitly covered in the Venn diagram problem)​

○​ Example 33: In a survey of 120 people, it was found that: 65 read Newsweek
magazine, 20 read both Newsweek and Time, 45 read Time, 25 read both
Newsweek and Fortune, 42 read Fortune, 15 read both Time and Fortune, 8 read
all three magazines. (a) Find the number of people who read at least one of the
three magazines. (b) Fill in the correct number of people in each of the eight
regions of the Venn diagram where N, T, and F denote the set of people who
read Newsweek, Time, and Fortune, respectively. (c) Find the number of people
who read exactly one magazine.
○​
○​ Example 48: In a survey of 120 people, it was found that: 65 read Newsweek
magazine, 20 read both Newsweek and Time, 45 read Time, 25 read both
Newsweek and Fortune, 42 read Fortune, 15 read both Time and Fortune, 8 read
all three magazines. (a) Find the number of people who read at least one of the
three magazines. (b) Fill in the correct number of people in each of the eight
regions of the Venn diagram where N, T, and F denote the set of people who
read Newsweek, Time, and Fortune, respectively.(c) Find the number of people
who read exactly one magazine.