0% found this document useful (0 votes)
37 views1 page

Module 3 DMS Assignment

The document is an assignment for a Discrete Mathematical Structures course, containing a series of mathematical problems and proofs. It includes topics such as functions, relations, the pigeonhole principle, and equivalence relations. Students are required to solve various problems related to these concepts, demonstrating their understanding of discrete mathematics.

Uploaded by

Hjhgh Hjhhjj
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
0% found this document useful (0 votes)
37 views1 page

Module 3 DMS Assignment

The document is an assignment for a Discrete Mathematical Structures course, containing a series of mathematical problems and proofs. It includes topics such as functions, relations, the pigeonhole principle, and equivalence relations. Students are required to solve various problems related to these concepts, demonstrating their understanding of discrete mathematics.

Uploaded by

Hjhgh Hjhhjj
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/ 1

DEPARTMENT OF MATHEMATICS

Approved by AICTE New Delhi | Affiliated to VTU, Belagavi |Accredited by NBA


Virgo Nagar, Bengaluru-560049
Assignment -3
Sem/Sec: IV Subject: DISCRETE MATHEMATICAL STRUCTURES
Subject code: BCS405A
S.NO Answer all the questions
1 Let A={a, b, c, d} and B={1, 2, 3, 4, 5}. Find the number of 1-1 functions and onto functions
from (i) A to B (ii) B to A
2 3𝑥 − 5 𝑖𝑓 𝑥 > 0
Let 𝑓: 𝑅 → 𝑅 be defined by 𝑓(𝑥) = { Find 𝑓 −1 (0), 𝑓 −1 (1), 𝑓 −1 (−1), 𝑓 −1 (3),
1 − 3𝑥 𝑖𝑓 𝑥 ≤ 0
𝑓 −1 (6), 𝑓 −1 ([−6, 5]), 𝑓 −1 ([−5, 5]).
3
4 State pigeon hole principle. Using pigeon hole principle find the minimum number of
persons chosen so that at least 5 of them will have their birthday in the same month.
5 Prove that at any set of 29 persons. At least 5 persons have been born on the same day of the
week.
6 Prove that if any 5 number from 1 to 8 chosen then two of them will have their sum 9.
7 Consider the functions 𝑓 and 𝑔 from 𝑅 to 𝑅 defined by 𝑓(𝑥) = 2𝑥 + 5 and
g(𝑥) = 1⁄2 (𝑥 − 5) . Prove that the 𝑔 is invers of 𝑓 .
1
8 Let 𝐴 = 𝐵 = 𝐶 = 𝑅, and 𝑓: 𝐴 → 𝐵 and g: 𝐵 → 𝐶 defined by 𝑓(𝑎) = 2𝑎 + 1, g(𝑏) = 3 𝑏, ∀𝑎 ∈
𝐴, ∀𝑏 ∈ 𝐵. Compute 𝑔𝑜𝑓 and show that 𝑔𝑜𝑓 is invertible. What is (𝑔𝑜𝑓)−1 ?
9 Let 𝑓 and 𝑔 be the functions from 𝑅 to 𝑅 defined by 𝑓(𝑥) = 𝑎𝑥 + 𝑏 and 𝑔(𝑥) = 1 − 𝑥 + 𝑥 2 , If
(𝑔𝑜𝑓)(𝑥) = 9𝑥 2 − 9𝑥 + 3 determine 𝑎 and 𝑏.
10 Let 𝐴 = {1, 2, 3, 4, 6} and 𝑅 be a relation on 𝐴 defined by a𝑅𝑏 if and only if 𝑎 is multiple of 𝑏.
Write down 𝑅 as set of order pair. Write relation matrix and draw the digraph.
11 Let 𝐴 = {1, 2, 3, 4} and 𝑅 be a relation on 𝐴 defined by 𝑥𝑅𝑦 if and only if 𝑥 < 𝑦. Write down 𝑅
as set of order pair. Write relation matrix and draw the digraph. List out the in degrees and
out degrees of every vertex.
12 Let 𝐴 = {1, 2, 3, 4, 5} and defined a relation 𝑅 𝑜𝑛 𝐴 × 𝐴 by (𝑥1 , 𝑦1 )𝑅(𝑥2 , 𝑦2 ). Iff 𝑥1 + 𝑦1 =
𝑥2 + 𝑦2 . (i) Verify that 𝑅 is an equivalence relation. (ii) Determine the equivalence class
[(2, 4)].
13 Let 𝐴 = {1, 2, 3, 6, 9, 12, 18} and defined 𝑅 𝑜𝑛 𝐴 by 𝑥𝑅𝑦 iff ‘𝑥 divides 𝑦 ’. Prove that (𝐴, 𝑅) is a
POSET. Draw the Hasse diagram of (𝐴, 𝑅).
14 Let 𝐴 = {1, 2, 3} R be a relation on power set P(A) defined by X𝑅𝑌 iff ‘𝑋 𝑖𝑠 𝑠𝑢𝑏 𝑠𝑒𝑡 𝑜𝑓 𝑌.
Prove that (𝑃(𝐴), 𝑅) is a POSET. Draw the Hasse diagram of (𝑃(𝐴), 𝑅).
15 Draw the Hasse diagram of positive divisors of 36.

You might also like