Programme Name and Semester: B.

Tech CSE (AIML_AIR_CYS), 3rd semester

Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Study Material
(Discrete Mathematics (BBS00008)
_____________________________________________________________________________________________

Table of Contents

Module I:
Introduction to Number Theory and Relations

Sl no. Topic Page no.

1. Introduction 2
2. Set 6
3. Cartesian Products, Binary Relation 7
4. Equivalence Relation 7
5. Partial Ordering Relation 8
6. The Division algorithm 8
7. The Greatest Common Divisor 9
8. The Fundamental Theorem of Arithmetic 9
9. Linear Diophantine equation 10
10. Introduction to Congruences 12
11. Solving linear congruences 13
12. The Chinese Remainder Theorem 14
13. Practice Questions 16-24
14. References 15

Module 1 Sets, Relation and Function

Department of Mathematics
Brainware University, Kolkata 1
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Introduction:

S et theory is a foundational branch of mathematical logic that studies sets, which are collections of distinct
objects. Developed in the late 19th and early 20th centuries, set theory provides a formal language and
framework for describing and analyzing mathematical and logical concepts.

Sets: A set is a well-defined collection of distinct objects, considered as an object in its own right. The objects within
a set are called elements. Sets are typically denoted by curly braces, and elements are listed inside. For example, if A
is the set of natural numbers less than 5, it can be written as A={1,2,3,4}.

Some predefined notations of sets:

N – Set of natural numbers

Z or I – Set of integers

Q – Set of complex numbers

R – Set of real numbers

{}- null set

Representation of Sets:
A set is described in the following two ways:

● Roster or Tabulation or Enumeration method

● Set Builder or Rule or Property method.

1. Roster Form:
In Roster form, all the elements of a set are listed.
For example, the set of natural numbers less than 5.
Natural Number = 1, 2, 3, 4, 5, 6, 7, 8,….
Natural Number less than 5 = 1, 2, 3, 4
Therefore, the set is N = { 1, 2, 3, 4 }

2. Set Builder Form:

The general form is, A = { x : property }
Example: Write the following sets in set builder form: A={2, 4, 6, 8}

Solution:
2=2x1
4=2x2
6=2x3
Department of Mathematics
Brainware University, Kolkata 2
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

8=2x4

So, the set builder form is A = {x: x=2n, n ∈ N and 1 ≤ n ≤ 4}

Also, Venn Diagrams are the simple and best way for visualized representation of sets.
Types of sets:
● Null set or Empty set: It is denoted by φ or{ }
a. φ is unique
b. φ is subset of every set
c. φ is never written within brackets i.e., { φ } is not the null set.

● Singleton set: The set { φ } is a singleton set.

● Finite set: A = (a, e, i, o, u} is a finite set.

● Infinite set:
A = (1, 2, 3, 4 } is an infinite set.

● Equivalent set:
Two finite sets A and B are equivalent if n(A) = n(B)

● Equal sets:
Two sets A and B are equal iff A = B

● Universal set: Superset of all the sets. It is usually denoted by Q or S or U or X.

● Power set: The family of all the subsets of set S is called the power set of S.
It is denoted by P(S) i.e., P(S) = {T: T ⊆ S}

● Subsets: If A is subset of B, then

A⊆B⇒a∈A⇒a∈B

a. Every set is a subset of itself i.e.,

A⊆A
Department of Mathematics
Brainware University, Kolkata 3
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

b. φ is a subset of every set.

c. If A ⊆ B and B ⊆ C ⇒ A ⊆ C
d. A = B iff a ⊆ B and B⊆ A

Proper Subsets:
If A is a proper subset of B, then A ⊂ B.

a. If A ⊆ B, we may have B ⊆ A
b. But if A ⊂ B, we cannot have B ⊂ A.

Question: Find the power set of Z = {2, 7, 9} and a total number of elements.
Solution: Given, Z = {2, 7, 9}
Total number of elements in power set = 2n
Here, n = 3 (number of elements in set Z)
So, 23 = 8, which shows that there are eight elements of power set of Z
Therefore,
P(Z) = {{}, {2}, {7}, {9}, {2, 7}, {7, 9}, {2, 9}, {2, 7, 9}}
Operations on Sets:
● Union of sets: Let A and B be two sets. Then, A ∪ B= {x : x ∈ A or x ∈ B}.
∴A ⊆ A ∪ B, B ∪ A and A ∪ B = B ∪ A

● Intersection of sets: Intersection of two sets A and B is denoted by,

A ∩ B= {x : x ∈ A and x ∈ B)
∴ A ∩ B ⊆ A, A ∩ B ⊆ B and A ∩ B = B ∩ A

● Disjoint sets: Two sets A and B are s.t.b disjoint if A ∩ B = φ

● Difference of sets: Let A and B be two sets, then A – B = {x : x ∈ A and x ∈ B} and B – A = {x : x ∈ B and
x ∈ A)

a. A–B≠B–A
b. The sets A – B, B – A and A ∩ B are disjoint sets.
c. A – B ⊆ A and B – A ⊆ B
d. A – φ = A and A – A = φ
It is denoted by A – B or A ~ B or A\B or CAB (complement of B in A).

● Symmetric difference of two sets: is denoted by,

Department of Mathematics
Brainware University, Kolkata 4
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

● A Δ B = (A – B) ∪ (B – A) = (A ∪ B) – (A ∩ B)

● Complement of a set:
The complement of A with respect to U is denoted by A' or Ac or C(A) or U – A

i.e., A' = {x ∈ U : x ∉ A}

Note: If X is the universal set and A, B ⊆ X, then

i. (A')' = A

ii. X' = φ
iii. φ'=X
iv. A ∩ A' = φ
v. A ∪ A' = X
vi. If A ⊆ B, then B' ⊆ A'

Distributive Properties of union and intersection:

i. A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)

ii. A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

Note: If A, B and C are any three sets, then

i. A ∩ (B − C) = (A ∩ B) − (A ∩ C)

ii. A ∩ (BΔC) = (A ∩ B)Δ(A ∩ C)

iii. P(A) ∩ P(B) = P(A ∩ B)

iv. P(A) ∪ P(B) = P(A ∪ B)
If P(A) = P(B) ⇒ A = B where, P(A) is the power set of A

De-Morgan’s laws:

i. (A ∪ B)' = A'∩ B'

ii. (A ∩ B)' = A'∪ B'

Department of Mathematics
Brainware University, Kolkata 5
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

iii. A − (B ∩ C) = (A − B) ∪ (A − C)
iv. A − (B ∪ C) = (A − B) ∩ (A − C)

Results on cardinal number of some sets:

If A, B and C are finite sets and U be the universal set, then

i. n(A ∪ B) = n(A) + n(B) if A and B are disjoint sets.

ii. n(A ∪ B) = n(A) + n(B) – n (A ∩ B)

iii. n(A ∪ B) = n(A − B) + n(B − A) + n(A ∩ B)

Cartesian Product of sets:

If set A and set B are two sets then the cartesian product of set A and

set B is a set of all ordered pairs (a,b), such that a is an element of A

and b is an element of B. It is denoted by A × B.
We can represent it in set-builder form, such as:
A × B = {(a, b) : a ∈ A and b ∈ B}

Example: set A = {1,2,3} and set B = {Bat, Ball}, then;

A × B = {(1,Bat),(1,Ball),(2,Bat),(2,Ball),(3,Bat),(3,Ball)}

Note: If A, B and C are three sets then,

i. A × (B∪ C) = (A × B) ∪ (A ×C)

ii. A × (B ∩ C) = (A × B) ∩ (A ×C)

iii. A ×(B − C) = (A × B) − (A × C)
iv. If A ⊆ B, then (A ×C) ⊆ (B×C)
v. If A ⊆ B, then (A × B) ∩ (B× A) = A2
vi. If A ⊆ B and C ⊆ D then A × C ⊆ B× D
vii. (A × B) ∩ (S ×T) = (A ∩S) ×(B ∩ T) ,

Department of Mathematics
Brainware University, Kolkata 6
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Relation:
If R is a relation from A to B then R ⊆ A × B ie, R ⊆ {(a,b):a ∈ A,b ∈ B}

Domain and Range of a Relation:

i. Domain of R = (a: (a, b) ∈ R}
ii. Range of R = {b: (a, b) ∈ R} If R is a relation from A to B,
then Dom (R) ⊆ A and Range (R) ⊆ B
(i.e., Co-domain)

Notes: Number of possible relations from A to B is = 2mn [if o(A) = m and o(B) = n]

Inverse Relation:
The inverse of R, denoted by R–1 is a relation from B to A and is defined by,

R–1 = {(b, a): (a, b) ∈ R}

Thus,
i. (a, b) ∈ R ⇔ (b, a) ∈ R–1 ∀ a ∈ A, b ∈ B
ii. Dom (R–1) = Range (R)
iii. Range (R–1) = Dom (R)
iv. (R–1)–1 = R

Equivalence Relation:
A relation R on a set ‘A’ is said to be equivalence relation on a iff

1. It is reflexive i.e.,(a, a) ∈ R ∀ a ∈ A

2. It is symmetric i.e., (a, b) ∈ R ⇒ (b, a) ∈ R ∀ a, b ∈ A

3. It is transitive i.e., (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) e R ∀ a, b, c, ∈ A.

Antisymmetric: A relation R on a set ‘A’ is said to antisymmetric i.e.,(a, b) ∈ R and (b, a) ∈ R, then a = b.
Question: Let R be the relation on the set R of all real numbers defined by a R b if and only if |a − b| ≤ 1. Then
check if R is reflexive, symmetric, anti-symmetric, or transitive.

Solution:
|a − a| = 0 < 1

Department of Mathematics
Brainware University, Kolkata 7
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Therefore, a R a ∀ a ∈ R

Therefore, R is reflexive.
Again a R b, |a − b| ≤ 1 ⇒ |b − a| ≤ 1 ⇒ b R a
Therefore, R is symmetric.

Again 1 R [½] and [½] R1 but [½] ≠ 1

Therefore, R is not anti-symmetric.
Further, 1 R 2 and 2 R 3, but 1 R 3 is not possible, [Because, |1 − 3| = 2 > 1]
Hence, R is not transitive.

Composition of two Relations: If A, B and C are three sets such that R ⊆ A × B and S ⊆ B × C, then SoR ⊆ A × C
and (SoR)–1 = R– 1oS–1. It is clear that aRb, bSc ⇒ a(SoR)c .
Partial Order Relations:

A relation R on a set A is called a partial order relation if it satisfies the following three properties:

1. Relation R is Reflexive, i.e. aRa ∀ a∈A.

2. Relation R is Antisymmetric, i.e., aRb and bRa ⟹ a = b.
3. Relation R is transitive, i.e., aRb and bRc ⟹ aRc.

Question: Show whether the relation (x, y) ∈ R, if, x ≥ y defined on the set of positive integers is a partial order
relation.

Solution: Consider the set A = {1, 2, 3, 4} containing four positive integers. Find the relation for this set such as R =
{(2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3), (1, 1), (2, 2), (3, 3), (4, 4)}.

Reflexive: The relation is reflexive as for every a ∈ A. (a, a) ∈ R, i.e. (1, 1), (2, 2), (3, 3), (4, 4) ∈ R.

Antisymmetric: The relation is antisymmetric as whenever (a, b) and (b, a) ∈ R, we have a = b.

Transitive: The relation is transitive as whenever (a, b) and (b, c) ∈ R, we have (a, c) ∈ R.

Partial Order Set (POSET):

The set A together with a partial order relation R on the set A and is denoted by (A, R) is called a partial orders set
or POSET.

Division Algorithm: Given integers a and d, with d > 0, there exists unique integers q and r, with 0 ≤ r < d, such
that a = qd + r.
(Notation: We call a the dividend, d the divisor, q the quotient, and r the remainder.)

Department of Mathematics
Brainware University, Kolkata 8
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Proof. Suppose a and d are integers, and d > 0. We will use the well-ordering principle to obtain the quotient q
and remainder r. Since we can take q = a if d = 1, we shall assume that d > 1. Let S be the set of all natural numbers
of the form a−kd, where k is an integer. In symbols

S = {a – kd | k ∈ Z and a − kd ≥ 0}. If we can show that S is nonempty, then the well-ordering principle will give us a
least element of S, and this will be the remainder r we are looking for. There are two cases.

Case 1: a ≥ 0. In this case, we can set k = 0 and get the element a − 0 · d = a ≥ 0 of S.

Case 2: a < 0. In this case, we can set k = a. Then a − kd = a − ad = a(1 − d). Since a < 0 and d > 1, a(1 − d) > 0; hence
is an element of S. Thus, S 6= ∅, and so S has a least element r = a − qd for some integer q. Thus, a = qd + r and r ≥
0. We are left to show (i) r < d and (ii) q and r are unique.

(i)Suppose r ≥ d. Then r = d + r 0 , where 0 ≤ r 0 < r. Then a = qd + r = qd + d + r 0 = (q + 1)d + r 0 , so that r 0 = a − (q

+ 1)d is an element of S smaller than r. This contradicts the fact that r is the least element of S. Thus, r < d.

(ii) Suppose integers q 0 and r 0 satisfy a = q 0d + r 0 and 0 ≤ r 0 < d. Without loss of generality, we may assume r 0
≥ r, so that 0 ≤ r − r 0 < d. Since a = q 0d + r 0 = qd + r, r − r 0 = d(q 0 − q). This means that d divides r − r 0 , which
implies either r − r 0 ≥ d or r − r 0 = 0. But but we know 0 ≤ r − r 0 < d. Thus, r 0 = r, which, in turn, implies q 0 = q.
That is, q and r are unique.

Prime Number: If p is an integer greater than 1, then p is a prime number if the only divisors of p are 1 and p.
Composite Number: A positive integer greater than 1 that is not a prime number is called composite.

Fundamental Theorem of Arithmetic: Every positive integer greater than one can be written uniquely as a product
of primes, where the prime factors are written in non-decreasing order
Greatest Common Divisor and Least Common Multiple:
Given integers a and b
(1) The greatest common divisor of a and b, denoted GCD (a, b), is the largest positive integer d such that d|a and
d|b.
(2) The least common multiple of a and b, denoted LCM (a, b), is the smallest positive integer m such that a|m
and b|m.
(3) a and b are called relatively prime if GCD (a, b) = 1.
(4) The integers 𝑎1 , 𝑎2 , 𝑎3 , . . . , an are called pairwise relatively prime if GCD(𝑎𝑖 , 𝑎𝑗 ) = 1 for 1 ≤ i < j ≤ n.

The Euclidean Algorithm:

Now we examine an alternative method to compute the gcd of two given positive integers a, b. The method
provides at the same time a solution to the Diophantine equation: ax + by = gcd(a, b). It is based on the following
fact: given two integers a ≥ 0 and b > 0, and r = a mod b, then gcd(a, b) = gcd(b, r).

Department of Mathematics
Brainware University, Kolkata 9
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Proof: Divide a by b obtaining a quotient q and a reminder r, then a = bq + r , 0 ≤ r < b . If d is a common divisor of
a and b then it must be a divisor of r = a−bq. Conversely, if d is a common divisor of b and r then it must divide a
= bq + r. So the set of common divisors of a and b and the set of common divisors of b and r are equal, and the
greatest common divisor will be the same. The Euclidean algorithm is a follows. First we divide a by b, obtaining a
quotient q and a reminder r. Then we divide b by r, obtaining a new quotient q0 and a reminder r0 . Next we divide
r by r0 , which gives a quotient q00 and another remainder r00. We continue dividing each reminder by the next
one until obtaining a zero reminder, and which point we stop. The last non-zero reminder is the gcd.

Example: Assume that we wish to compute gcd(500, 222). Then we arrange the computations in the following
way:
500 = 2 · 222 + 56 → r = 56
222 = 3 · 56 + 54 → r’= 54
56 = 1 · 54 + 2 → r’’ = 2
54 = 27 · 2 + 0 → r’’’ = 0
The last nonzero remainder is r’’ = 2, hence gcd(500, 222) = 2.
Furthermore, if we want to express 2 as a linear combination of 500 and 222, we can do it by working backward:
2 = 56 − 1 · 54 = 56 − 1 · (222 − 3 · 56) = 4 · 56 − 1 · 222 = 4 · (500 − 2 · 222) − 1 · 222 = 4 · 500 − 9 · 222

Linear Diophantine Equation in Two Variables:

Introduction:

Existence of Solutions:

Department of Mathematics
Brainware University, Kolkata 10
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Applications:

Department of Mathematics
Brainware University, Kolkata 11
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Introduction to Congruences and Solving Linear Congruences:

Department of Mathematics
Brainware University, Kolkata 12
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Department of Mathematics
Brainware University, Kolkata 13
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

The Chinese Remainder Theorem

Department of Mathematics
Brainware University, Kolkata 14
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Department of Mathematics
Brainware University, Kolkata 15
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

Practice Problem:

Questions for Practice.

A. MCQ Answer Type Questions:

1. Select the correct option from the following that is not true for a partial order relation.
a. It must be antisymmetric b. It must be symmetric
c. It must be transitive d. It must be reflexive

Department of Mathematics
Brainware University, Kolkata 16
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

2. Illustrate the Cartesian product of A = {1, 2} and B = {a, b}.

a. {(1, 1), (2, 2), (a, a), (b, b)} b. {(1, a), (2, a), (1, b), (2, b)}
c. {(1, a), (1, b), (2, a), (b, b)} d. {(1, 1), (a, a), (2, a), (1, b)}
3.
Consider the set 𝑨 = {𝟏, 𝟐, 𝟑} and the relation 𝑹 = {(𝟏, 𝟏),
(𝟐, 𝟐), (𝟑, 𝟑), (𝟏, 𝟐), (𝟐, 𝟑), (𝟏, 𝟑)}. Select the correct option.

a. it is not reflexive b. it is not transitive

c. it is a partial order d. it is not antisymmetric
4. Select the correct option. Let R be a symmetric and transitive relation on a set A. Then
a. R is reflexive and hence a partial b. R is reflexive and hence a
order equivalence relation
c. R is not reflexive and hence a d. None of these
equivalence relation
5. Let 𝐴 = {1,2,3} and the relation 𝑅 = {(1,1), (2,2), (3,3), (1,2), (2,1), (2,3)}. Then select
the correct one.
a. it is equivalence relation b. it is symmetric
c. it is not transitive d. it is not reflexive
6. Select the correct option from the following that defines a valid equivalence relation on the
set of integers ℤ.
a. 𝑎𝑅𝑏 ⟺ 𝑎 + 𝑏 is even b. 𝑎𝑅𝑏 ⟺ 𝑎. 𝑏 > 0
c. 𝑎𝑅𝑏 ⟺ 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 3) d. 𝑎𝑅𝑏 ⟺ 𝑎 < 𝑏
7. Select the correct option. The relation {(1,2), (1,3), (3,1), (1,1), (3,3), (3,2)} is
a. Reflexive b. Symmetric
c. Transitive d. Asymmetric
8. Select the correct option. The total number of reflexive relations on a set with n elements
is…
a. 2n (n+1) / 2 b. 2n(n - 1)
c. 2n d. 2n+2
9. Memorize the total number of symmetric relations possible on a set with n elements and it
is

Department of Mathematics
Brainware University, Kolkata 17
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

a. 2n (n+1) / 2 b. 2n(n - 1)
c. 2n d. 2n+2
10. Select the correct option. Division Algorithm states
a. 𝑎 = 𝑞𝑏 + 𝑟, where 0 ≤ 𝑟 < 𝑏 b. 𝑎 = 𝑞𝑏 + 𝑟, where 0 < 𝑟 < 𝑏
c. 𝑎 = 𝑞𝑏 + 𝑟, where 𝑟 > 𝑏 d. 𝑎 = 𝑞𝑏 + 𝑟, where 𝑟 < 0
11. Select the correct option. If 𝑆 = {∅} then power set of S is
a. {∅} b. ∅
c. {∅, {∅}} d. None of these
12. Select the correct option. The Division Algorithm is applicable to the numbers
a. Only positive integers b. All integers
c. rational numbers d. None of these
13. Observe and find out the singleton set from the following.
a. A = { x : 3 x2 − 27= 0 , x ∈ Q } b. B = { x : x2− 1 = 0 , x ∈ R }
c. C = { x : 30 x − 59 = 0 , x ∈ N} d. D = { x : x2 − 1 = 0 , x ∈ N }
14. If 𝑎 = −17 and 𝑏 = 5, then identify the quotient and remainder according to the Division
Algorithm.
a. 𝑞 = −4, 𝑟 = 3 b. 𝑞 = −3, 𝑟 = 2
c. 𝑞 = −5, 𝑟 = 8 d. 𝑞 = 3, 𝑟 = 2
15. If A and B are sets and A∪ B= A ∩ B, then select the correct option.
a. A = Φ b. B = Φ
c. A = B d. none of these
16. Predict the number of elements in the power set of the set {a, b}.
a. 2 b. 4
c. 6 d. 8
17. Select the correct option. Let N be the set of natural numbers and R be the relation in N
defined as R = {(a, b) : a = b – 2, b > 6}.
a. (2, 4) ∈ R b. (8, 7) ∈ R
c. (3, 8) ∈ R d. (6, 8) ∈ R
18. A survey shows that 70% of the Indian like mango whereas 82% like apple. Interpret the
range of x if x% of Indian like both mango and apples.

Department of Mathematics
Brainware University, Kolkata 18
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

a. x = 52 b. 52  x  70

c. x = 70 d. 70  x  82
19. Select the correct option. If 𝑋 ∪ {3,4} = {1,2,3,4,5,6}, then
a. Smallest set X = {1,2,5,6} b. Smallest set X= {1,2,3,5,6}
c. Smallest set X= {1,2,3,4} d. Greatest set X= {1,2,3,4}
20. If two sets A and B are having 43 elements in common, then select the number of elements
in the set A∩ B
a. 43 b. 43
2

43 86
c. 43 d. 2
21. In a certain town 30% families own a scooter and 40% on a car 50% own neither a scooter
nor a car 2000 families own both a scooter and car consider the following statements in this
regard
(1) 20% families own both scooter and car
(2) 35% families own either a car or a scooter
(3) 10000 families live in town
Identify the correct statements from the above.
a. 2 and 3 b. 1 and 2
c. 1 and 3 d. 1, 2 and 3
22.
n  P  P  P ( A)   =
If set A is an empty set then illustrate the value of
a. 6 b. 16
c. 2 d. 4
23. If 𝑎 ≡ 2 (𝑚𝑜𝑑 5) and 𝑏 ≡ 3 (𝑚𝑜𝑑 5), then identify the value of (𝑎 + 𝑏) mod 5.
a. 0 b. 1
c. 2 d. 3
24. Identify the value of 𝑥 for 25 ≡ 𝑥 (𝑚𝑜𝑑 7).
a. 4 b. 5
c. 3 d. 111
25. A = ( x, y ) : y = e x , x  R B = ( x, y ) : y = e − x , x  R
Let , then predict the correct option.

Department of Mathematics
Brainware University, Kolkata 19
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

a. A B =  b. A  B  
c. A B = R d. A  B = A
26. Let R be a reflexive relation of a finite set A having n elements and let there be m ordered
pairs in R. Then observe the correct option.

a. mn b. m  n
c. m = n d. None of these
27.
Let R be a relation on N defined by 
R = (1 + x,1 + x2 ) : x  5, x  N  . Select the correct
option.

R = ( 2,2 ) , ( 3,5) , ( 4,10 ) , ( 5,17 ) , ( 6,25) b. Domain of R = {2,3,4,5,6}

a.
c. Range of R = {2,5,10,17,26} d. (b) and (c) are true
28. Let R be the real line consider the following subsets of the plane R  R ,
S = ( x, y ) : y = x + 1 and 0  x  2 T = ( x, y ) : x − y is an integer
, . Then select the
correct option from the following.
a. T is an equivalence relation on R but b. Neither S nor T is an equivalence
S is not. relation on R
c. Both S and T are equivalence d. S is an equivalence relation on R
relations on R but T is not
29. If A is the set of even natural numbers less than 8 and B is the set of prime numbers less
than 7, then identify the number of relations from A to B.
9 2
a. 2 b. 9

d. 2 − 1
2 9
c. 3
30. For m, n  N , n | m means that n is a factor of m, then classify the relation | from the
following.
a. Reflexive and symmetric b. Transitive and symmetric
c. Reflexive, transitive and symmetric d. Reflexive, transitive and not
symmetric
31. A = 1, 2,3, 4,5
Select the correct option. The relation  is defined on the set by

 = ( x, y ) | x2 − y 2  16  is given by
a. {(1,1), (2,1), (3,1), (4,1), (2,3)} b. {(2,2), (3,2), (4,2), (2,4)}

Department of Mathematics
Brainware University, Kolkata 20
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

c. {(3,3), (4,3), (5,4), (3,4)} d. None of these

32. If gcd(𝑎, 𝑏) = 𝑑, then select the correct option.

a. 𝑑 divides both 𝑎 and 𝑏 b. 𝑑 is the largest number that divides

both 𝑎 and 𝑏
c. gcd(𝑏, 𝑎) = 𝑑 d. All of the above
33. Identify the GCD of 270 and 192 using the Euclidean Algorithm.

a. 12 b. 6
c. 18 d. 24
34. R = ( a, b ) , ( b, c ) A = a, b, c
Given the relation in the set then identify the
minimum number of ordered pairs that need to be added to R make it an equivalence
relation.
a. 5 b. 6
c. 7 d. 8
35.
Let R be the relation over the set N  N and is defined by ( a, b ) R ( c, d )  a + d = b + c
then classify the relation R.
a. Reflexive only b. Symmetric only
c. Transitive only d. An equivalence relation
36.
Select the correct option. If S is defined on R by ( x, y )  S  xy  0 then S is
a. An equivalence relation b. Reflexive only
c. Symmetric only d. Transitive only
37. Select the correct option. A linear Diophantine equation in two variables has the form:
a. 𝑎𝑥 2 + 𝑏𝑦 = 𝑐, where 𝑎, 𝑏, 𝑐 ∈ ℤ b. 𝑎𝑥 + 𝑏𝑦 = 𝑐, where 𝑎, 𝑏, 𝑐 ∈ ℤ

c. 𝑎𝑥 + 𝑏𝑦 + 𝑐𝑧 = 𝑑, where 𝑎, 𝑏, 𝑐, 𝑑 ∈ d. 𝑎𝑥𝑦 = 𝑐, where 𝑎, 𝑐 ∈ ℤ

ℤ
38. Select the correct option. The linear Diophantine equation 4𝑥 + 6𝑦 = 14 has:

a. No solution b. A unique integer solution

c. Infinitely many integer solutions d. Exactly two integer solutions
39. Identify the number of integer solutions of the equation 6𝑦 + 9𝑦 = 20 is
a. 0 b. 1

Department of Mathematics
Brainware University, Kolkata 21
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

c. 2 d. Infinitely many
40. Identify the condition for the equation 𝑎𝑥 + 𝑏𝑦 = 𝑐 to have integer solutions.
a. 𝑐 must be even b. 𝑎 = 𝑏

c. gcd(𝑎, 𝑏) ∕ 𝑐 d. 𝑎𝑏 ∕ 𝑐
41. Select the correct option. If 𝑎𝑥 + 𝑏𝑦 = 𝑐 has one integer solution, then:

a. It has exactly one more b. It has no more solutions

c. It has infinitely many solutions d. It has only complex solutions
42. Select the correct option. For all odd integer a, gcd(3a,3a+2)=
a. 1 b. 2
c. 3 d. None of these
43.
Select the correct option. The Euclidean algorithm is used to:

a. Solve equations b. Find LCM

c. Find GCD d. Find roots of polynomials
44. Identify the equation having no integer solution.
a. 8𝑥 + 6𝑦 = 10 b. 2𝑥 + 4𝑦 = 6
c. 3𝑥 + 7𝑦 = 1 d. 9𝑥 + 3𝑦 = 10
45. If 𝑥 ≡ 1 (𝑚𝑜𝑑 2) and 𝑥 ≡ 2 (𝑚𝑜𝑑 3), identify the smallest 𝑥.
a. 2 b. 4
c. 5 d. 8
46. Let 𝑥 ≡ 3 (𝑚𝑜𝑑 5) and 𝑥 ≡ 4 (𝑚𝑜𝑑 7). Identify the least positive 𝑥.
a. 24 b. 38
c. 18 d. 10
47. Let 𝑥 ≡ 4 (𝑚𝑜𝑑 6) and 𝑥 ≡ 3 (𝑚𝑜𝑑 8). Then choose the correct option from below if a
solution is possible using Chinese Remainder Theorem.
a. Yes, always b. No, since 6 and 8 are not coprime

c. Yes, only if the remainders are the d. No, because 4 > 3

same

Department of Mathematics
Brainware University, Kolkata 22
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

B. Short Answer Type Questions:

1. Identify all integer solutions of the equation 12x + 8y = 4.

2. Identify all integer solution to 15x + 21y = 6.

3. Identify the GCD of 252 and 105 using the Euclidean Algorithm.

4. Identify two integers 𝑢 and 𝑣 satisfying 63𝑢 + 55𝑣 = 1.

5. Describe The Fundamental Theorem of Arithmetic.

6. Describe The Division algorithm.

7. Examine the relation 𝑅 on 𝑍 defined by 𝑎𝑅𝑏 if and only if 𝑎 − 𝑏 is even, an equivalence

relation.

8. Let 𝐴 = {1,2,3} and let 𝑅 = {(1,1), (2,2), (3,3), (1,2), (2,1)}. Examine if 𝑅 is an equivalence
relation on 𝐴.

9. Let 𝑅 on ℤ be defined as 𝑎𝑅𝑏 if and only if 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 5). Show that 𝑅 is an equivalence
relation.

10. State the Chinese Remainder Theorem

Department of Mathematics
Brainware University, Kolkata 23
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

C. Long Answer Type Questions:

1.
State the partial order relation. Examine if the subset relation ⊆ on power set 𝑃(𝑆) a partial
order.

2. Show that congruence modulo 𝑛 is an equivalence relation.

3. Identify the Hasse diagram for the power set of {𝑎, 𝑏} ordered by inclusion.

4. Discuss a linear Diophantine equation in two variables. Discuss the condition for its
solvability. Also, identify all integer solutions of the equation 15𝑥 + 21𝑦 = 6.

5. Examine if the relation R = {(p, q): |p-q| is even} is an equivalence relation on the set P= {3,
4, 5,6}.

6.
Consider A = {2, 3, 4, 5} and R = {(5, 5), (5, 3), (2, 2), (2, 4), (3, 5), (3, 3), (4, 2), (4, 4)}, then
examine if R is an Equivalence Relation.

7. Examine that cube of any integer can be written in the form 9k, 9k + 1 or 9k − 1 for some k ∈
Z, Z is the set of all integers.

8. Identify the solution of the linear congruence 4𝑥 ≡ 8 (𝑚𝑜𝑑 8).

9. Identify the solution of the system of linear congruences using Chinese Remainder Theorem:
𝑥 ≡ 2 (𝑚𝑜𝑑 3), 𝑥 ≡ 3 (𝑚𝑜𝑑 4), 𝑥 ≡ 2 (𝑚𝑜𝑑 5).

10. Identify the solution of the system of linear congruences using Chinese Remainder Theorem:
𝑥 ≡ 1 (𝑚𝑜𝑑 7), 𝑥 ≡ 2 (𝑚𝑜𝑑 8), 𝑥 ≡ 3 (𝑚𝑜𝑑 9).

Department of Mathematics
Brainware University, Kolkata 24
Programme Name and Semester: B. Tech CSE (AIML_AIR_CYS), 3rd semester
Course Name (Course Code): Discrete Mathematics (BBS00008)
Academic Session: 2025-26

References:
1. “Discrete Mathematics and Its Applications”, Kenneth H. Rosen, McGraw-Hill.
2. “Discrete Mathematics with Applications”, Susanna S Epp, Wadsworth Publishing Co. Inc, 4th edition
3. “Elements of Discrete Mathematics: a computer oriented approach”, C L Liu and Mohapatra, McGraw
Hill, 3rd edition.
4. “Discrete Mathematical Structures and its Application to Computer Science”, J P Trembley, R
Manohar, TMG Edition, Tata McGraw-Hill.
5. “Discrete Mathematics”, Norman L Biggs, Oxford University Press, 2nd Edition.
6. “Discrete Mathematics”, Schaum’s Outlines Series, Semyour Lipschutz and Marc Lipson

Department of Mathematics
Brainware University, Kolkata 25