Scribd
Upload
17 views3 pages

DMS Module 3 - QB PDF

The document is a question bank for a mathematics module, containing various questions related to set theory, functions, relations, and equivalence relations. It includes problems on Cartesian products, injective functions, function inverses, Pigeonhole principle, and Hasse diagrams. The questions are designed to test understanding and application of mathematical concepts in discrete mathematics.

Uploaded by

Vignesh Nagaraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views3 pages

DMS Module 3 - QB PDF

The document is a question bank for a mathematics module, containing various questions related to set theory, functions, relations, and equivalence relations. It includes problems on Cartesian products, injective functions, function inverses, Pigeonhole principle, and Hasse diagrams. The questions are designed to test understanding and application of mathematical concepts in discrete mathematics.

Uploaded by

Vignesh Nagaraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Department of Mathematics

QUESTION BANK - MODULE 3


Sl Questions
No
1 Define Cartesian product of two sets. For any three non-empty sets A, B and C. Prove that
A x (B-C) = (AxB) - (AxC).
2 If А= {1, 2, 3, 4, 5} and there are 6720 injective functions f: A→B, what is |B|?
3 3x − 5 if x > 0
Let f: R → R be defined by, 𝑓(𝑥) = { .
1 − 3x if x ≤ 0
Find 𝑓 −1 (0), 𝑓−1 (1), 𝑓−1 (−1), 𝑓−1 (3), 𝑓−1 (6), 𝑓−1 ([−6, 5]) and 𝑓 −1 ([−5, 5]).
4 Let A={1, 2, 3, 4} and B={1, 2, 3, 4, 5,6}.
i. How many functions are there from A to B?
ii. How many of these are one to one?
iii. How many are onto?
iv. How many functions are there from B to A?
v. How many of these are onto?
vi. How many are one to one?
5 Let A = {a, b, c, d} and B = {1, 2, 3, 4, 5}. Find the number of 1-1 functions and onto
functions from a. A to B
b. B to A
6 Let m, n be positive integers with 1 < n ≤ m then prove that, s (m+1,n) = s (m,n-1)+n s(m,n).
7 If 𝑓: 𝐴→𝐵, 𝑔: 𝐵→𝐶, ℎ: 𝐶→𝐷 are three functions, then Prove that h∘(g∘f)=(h∘g)∘f.
8 Let f and g be functions from R to R defined by 𝑓(𝑥) = 𝑎𝑥 + 𝑏 and 𝑔(𝑥) = 1 − 𝑥 + 𝑥2.
If (𝑔 𝑜 𝑓)(𝑥) = 9𝑥2 − 9𝑥 + 3 determine 𝑎 and 𝑏.
9 Let f, g, h be functions from Z to Z defined by 𝑓 (𝑥) = 𝑥 − 1, 𝑔 (𝑥) = 3𝑥, ℎ(𝑥) =
0, if x is even
{
1, if x is odd
Determine (fo(goh))(x), ((fog)oh)(x) and verify that fo(goh) = (fog)oh.
10 Let f, g, h: R→ R where f(x)=x2, g(x)=x+5 and h(x)= √x 2 + 2. Show that (hog)of = ho(gof).
11 1
Let 𝐴 = 𝐵 = 𝐶 = 𝑅, and 𝑓: 𝐴 → 𝐵 and 𝑔: 𝐵 → 𝐶 be defined by 𝑓(𝑎) = 2𝑎 + 1, 𝑔(𝑏) =3 b,
∀𝑎 ∈ 𝐴, ∀𝑏 ∈ 𝐵. Compute 𝑔𝑜𝑓 and show that 𝑔𝑜𝑓is invertible. What is (𝑔 𝑜 f )−1 ?
12 Consider the function f: R→R defined by f(x) = 2x + 5. Let a function g: R→R be defined by
1
g(x) = 2 (x-5). Prove that g is inverse of f.
13 x−5
Let f and g be two functions form R to R defined by f(x) = 2x + 5 and g(x) = . Show that f
2
and g are invertible to each other.
14 Prove that a function f: A→B is invertible iff it is one-one and onto.
15 State Pigeon hole principle. Prove that in any set of 29 persons at least 5 persons have been
born on the same day of the week.
16 State Pigeon hole principle Show that if n+1 numbers are chosen from 1 to 2n then at least one
pair add to 2n+1.
17 State Pigeon –hole principle. Prove that if any number from1 to 8 are chosen then two of them
will have their sum as 9.
18 State Pigeonhole principle. Let ABC is an equilateral triangle whose sides are of length 1cm
each. If we select 5 points inside the triangle, prove that at least two of their points are such
that the distance between them is less than ½ cm
19 State Pigeonhole principle. Show that if any seven numbers from 1 to 12 are chosen, then two
of them will add to 13.
20 Let A= {1,2,3,4,6} and ‘R’ be a relation on ‘A’ defined by aRb if and only if “a is multiple of
b”. Write down the relation 𝑅, relation matrix 𝑀(𝑅) And draw its digraph. List out its in degree
and out degree.
21 Let A= {1,2,3,4} and R be a relation on ‘A’ defined by xRy if and only if x < y. Write down 𝑅
as a set of ordered pairs. Write the relation matrix and draw the digraph. List out the in
degrees and out degrees of every vertex.
22 For A ={1, 2, 3, 4}, let R{(1, 1) (1, 2) (2, 3) (3, 3) (3, 4)} be a relation on A. Draw the directed
graph G on A that is associated with R. Do likewise for R2, R³.
23 If A= {1, 2, 3, 4}, R and S are relations on A defined by R = {(1, 2), (1, 3), (2, 4), (4, 4)}
S={(1, 1), (1, 2), (1,3), (1, 4), (2, 3), (2, 4)} find RoS, SoR, R2, S2 and write down their
matrices.
24 Define the relation R for two lines l1 and l2 by l1 R l₂ if l1 is perpendicular to l2. Determine
whether the relation is reflexive, symmetric, antisymmetric or transitive.
25 Let A= {1, 2, 3, 4, 5}. Define a relation R on A x A by (x1, y1) R (x2, y2) iff x1 + y1 = x2 + y2.
i. Verify that R is an equivalence relation on A x A
ii. Determine equivalence classes [(1, 3)], [(2, 4)] and [(1, 1)]
26 Define partition of a set. If R is a relation defined on A ={1, 2, 3, 4} by
R =Determine
iii. {(1, 1), (1,2), (2, 1),
partition of(2,
A x2),A(3, 3), (3,by
induced 4),R.
(4, 3), (4, 4)}, determine the partition induced by
R
27 Draw the Hasse diagram representing the positive divisors of 72.
28 Let A= {1, 2, 3, 6, 9, 18}; and define R on A by xRy if "x divides y", Draw the Hasse diagram
for (A, R). Prove that (A,R) is a POSET.
29 Consider Poset whose Hasse diagram is given below. Consider B= {3, 4, 5}. Find upper and
lower bounds of B, least upper bound and greatest lower bound of B. (Ref. Fig.Q6(b)).

30 Define an equivalence relation. Write the partial order relation for the positive divisors of 36
and write its Hasse diagram (HASSE).
31 Let A= {a, b, c), B = P(A) where P(A) is the power set of A. Let R be a subset relation on A.
Show that (B, R) is a POSET and draw its Hasse diagram.
32 Show that the set of positive divisors of 36 is a POSET and draw its Hasse diagram. Hence
find its i) least element ii) greatest element.

You might also like