DISCRETE STRUCTURES (co3)

Relation
1. If A={1,4,5} and the relation R defined on the set A as aRb if a+b < 6 check
whether the relation R is an equivalence relation
2. Define Partial Order relation and check whether R is Partial Order relation.
R= {(x,y) 𝑖𝑓 𝑦 = 𝑥 𝑟 , 𝑟 𝑖𝑠 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 𝑎𝑛𝑑 𝑎, 𝑏 ∈ 𝑍}.
3. Show that the relation 𝑅 = {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 𝑎 − 𝑏 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 5 , 𝑎, 𝑏 ∈ 𝑍} is
an equivalence relation hence find all equivalence classes
4. Show that the relation 𝑅 = {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 𝑎 − 𝑏 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 4 , 𝑎, 𝑏 ∈ 𝑍} is
an equivalence relation hence find all equivalence classes
5. Show that the relation 𝑅 = {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 𝑎 − 𝑏 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 7 , 𝑎, 𝑏 ∈ 𝑍} is
an equivalence relation hence find all equivalence classes
6. Show that the relation 𝑅 = {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 2𝑎 + 3𝑏 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 5 , 𝑎, 𝑏 ∈ 𝑍}
is an equivalence relation
7. Show that the relation 𝑅 = {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 3𝑎 + 4𝑏 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 7 , 𝑎, 𝑏 ∈ 𝑍}
is an equivalence relation
8. If A={a,b,c,} and find relation R such that (i) R is reflexive , but not symmetric ,
not transitive (ii) R is reflexive , symmetric , but not transitive.
9. If A={a,b,c,} and find relation R such that (i) R is not reflexive , not symmetric ,
but transitive (ii) R is reflexive , transitive , but not symmetric
10. Draw the digraph and find matrix of relation for R∪ 𝑆 and R∩ 𝑆 if relations R & S
are defined on a set 𝐴 = {1,2,3,4,5,6} as
𝑅 = {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 𝑎 𝑑𝑒𝑣𝑖𝑑𝑒𝑠 𝑏, ∀ 𝑎, 𝑏 ∈ 𝐴 }
𝑆 = {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 𝑎 𝑖𝑠 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 𝑏 , ∀ 𝑎, 𝑏 ∈ 𝐴 }
11. Draw the digraph for 𝑅̅ ∪ 𝑆̅ and 𝑅 −1 ∩ 𝑆 −1 where R & S are defined on a set 𝐴
If 𝐴 = {1,2,3,4} as 𝑅 = {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 𝑎 < 𝑏, ∀ 𝑥, 𝑦 ∈ 𝐴 }
𝑆= {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 𝑎 < 𝑏 + 1, ∀ 𝑎, 𝑏 ∈ 𝐴 }
12. Show that the relation 𝑅 = {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 3𝑎 + 2𝑏 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 5 , 𝑎, 𝑏 ∈ 𝑍}
is an equivalence relation
13. Show that the relation 𝑅 = {(𝑎, 𝑏) 𝑠𝑢𝑐ℎ𝑡ℎ𝑎𝑡 4𝑎 + 3𝑏 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 7 , 𝑎, 𝑏 ∈ 𝑍}
is an equivalence relation
14. Draw the digraph of R , find matrix of R hence check whether R is reflexive ,
symmetric , transitive where A = {a,b,c,d} and a relation R is defined on A as
R={(a,a)(b,b)(c,c)(a,b)(b,a)(a,c)(c,b)(b,c)(d,d)(c,d)(d,c)}
15. A relation R is defined on set of integers Z as 𝑎𝑅𝑏 if 8 divides 𝑎 − 𝑏 Prove that R is
an equivalence relation
16. If A={2,3,4,5,6} and the relation R defined on the set A as aRb if a+b < 7. (i) Draw
the digraph of R (ii) find matrix of R (iii) Check whether R is reflexive , symmetric
, transitive ?
17. If A={1,4,7} then write all possible partitions and corresponding equivalence
relations
18. If A={a,b,c,d} then write all possible partitions and corresponding equivalence
relations.
19. if relations If A={a,b,c,d} and find relation R such that (i) R is reflexive , but not
symmetric , not transitive (ii) R is reflexive , symmetric , but not transitive
20. Determine whether the relation R on a set A is reflexive, symmetric, antisymmetric
or transitive. A = set of all positive integers, a R b iff |𝑎−𝑏|≤2
21. Determine whether the relation R on a set A={}1,2,3,5} is reflexive, symmetric,
antisymmetric or transitive. A = set of all positive integers, a R b iff |𝑎−𝑏|≤4
22. let A = {1, 2, …., 8}. Let R be the equivalence relation defined by x ≡ ymod(4)
Write R as a set of ordered pairs Find the partition of A induced by R .
23. A = {1, 2, 3, 4} and R = {(1, 1), (1, 2), (2, 1), (2, 2), (3,4), (4, 3), (3, 3), (4, 4)}.
Shows that R is an equivalence relation on A hence find partition of A induced
by R.
24. let A = {1, 2, 3,4}. Let R & S be an equivalence relations on A given as
R = {(1, 1), (1, 2), (2, 1), (2, 2), (3,4), (4, 3), (3, 3), (4, 4)}
S= {(1, 1), (2, 2), (3,1), (1, 3), (3, 3), (4, 4)}

find partition of A induced by 𝑅 −1 ∩ 𝑆 −1 , 𝑅 −1 , 𝑅 ∩ 𝑆

25. Let A = {1, 2, 3, 4}, B = {a, b, c, d},C = {x, y, z } and

FUNCTION:
2𝑥−3
1. Show that 𝑓: 𝑅 − {1} → 𝑅 − {2} such that 𝑓(𝑥) = is bijective
𝑥−1
1
2. If 𝑓: 𝑅 − {3} → 𝑅 − {0} is defined as (𝒙) = 𝑥−3 . Show that 𝒇(𝒙) is bijective and
hence find 𝑓 −1 (𝑥).
1
3. If f: 𝑅 − {5} → 𝑅 − {0} is defined as f(x) = 𝑥−5 . Show that f(x) is bijective and
hence find 𝑓 −1 (𝑥).
4. Check whether the function 𝑓: 𝑍 → 𝑍 such that 𝑓(𝑥) = 𝑥 2 + 𝑥 + 1 is bijective.
5. If the functions 𝑓 & 𝑔 are defined as 𝑓: 𝑅 → 𝑅 such that 𝑓(𝑥) = 2 + 3𝑥 and
𝑔: 𝑅 → 𝑅 such that 𝑔(𝑥) = 4 − 2𝑥. Find 𝑓 ∗ 𝑔(𝑥) & 𝑔 ∗ 𝑓(𝑥)..
6. Functions 𝑓: 𝑅 → 𝑅 , 𝑔: 𝑅 → 𝑅 are defined as 𝑓(𝑥) = 2𝑥 + 3, 𝑔(𝑥) = 3𝑥 − 4.
Find 𝑔−1 . 𝑓 −1
7. Functions 𝑓: 𝑅 → 𝑅 , 𝑔: 𝑅 → 𝑅 are defined as 𝑓(𝑥) = 2𝑥 − 3, 𝑔(𝑥) = 4 − 3𝑥
Solve𝑔−1 . 𝑓 −1 (𝑥) = 2 .
3𝑥
8. If f: 𝑅 − {1} → 𝑅 is defined as f(x) = 𝑥−1 . Show that f(x) is bijective and hence
find 𝑓 −1 (𝑥).
3𝑥−2
9. Function 𝑓: 𝑅 − {1} → 𝑅 − {3} is defined as 𝑓(𝑥) = 𝑥−1 . Prove that 𝑓 is bijective
10. Functions 𝑓: 𝑅 → 𝑅 , 𝑔: 𝑅 → 𝑅 are defined as 𝑓(𝑥) = 5𝑥 + 3, 𝑔(𝑥) = 1 + 3𝑥
then find 𝑓𝑜𝑔 , 𝑓𝑜𝑓 , 𝑔𝑜𝑓 & 𝑔𝑜𝑔𝑜𝑓
11. Functions 𝑓: 𝑅 → 𝑅 , 𝑔: 𝑅 → 𝑅 are defined as 𝑓(𝑥) = 2𝑥 − 3, 𝑔(𝑥) = 3𝑥 + 2
then Show that 𝑓(𝑥), 𝑔(𝑥) are bijective and hence find 𝑓 −1 (𝑥), 𝑔−1 (𝑥),
−1 −1
𝑔𝑜𝑓 & 𝑔 𝑜𝑓
12. Functions 𝑓: 𝑅 → 𝑅 , 𝑔: 𝑅 → 𝑅 are defined as 𝑓(𝑥) = 𝑥 − 4, 𝑔(𝑥) = 6 + 7𝑥 then
then Show that 𝑓(𝑥), 𝑔(𝑥) are bijective and hence find 𝑓 −1 (𝑥), 𝑔−1 (𝑥), 𝑓 −1 𝑜𝑔
13. If 𝑓, 𝑔: 𝑅 → 𝑅 are defined as 𝑓(𝑥) = 2𝑥, 𝑔(𝑥) = 𝑥 + 4. Show that 𝑓(𝑥), 𝑔(𝑥) are
bijective and hence find 𝑓 −1 (𝑥), 𝑔−1 (𝑥).
14. Functions 𝑓: 𝑅 → 𝑅 , 𝑔: 𝑁 → 𝑁 are defined as 𝑓(𝑥) = 𝑥 2 , 𝑔(𝑥) = 𝑥 2 Check
whether the functions are injective.
15. Give function 𝑔: 𝑁 → 𝑁 which is injective ,but not surjective with justification
16. Give function 𝑔: 𝑁 → 𝑁 which is not injective ,but surjective with justification

Groups