Consider the relations and defined as for all and for all Then [2024]
and both are equivalence relations
Only is an equivalence relation
Only is an equivalence relation
Neither nor is an equivalence relation
(C)
...(i)
...(ii)
Let S = {1, 2, 3,…,10}. Suppose M is the set of all the subsets of S, then the relation is: [2024]
symmetric and transitive only
reflexive only
symmetric and reflexive only
symmetric only
(D)
Given,
So, R is not reflexive.
If
So, R is symmetric.
If and and
is not necessarily non-empty set.
Hence, not necessarily belongs to R.
So, R is not a transitive relation.
Given relation is symmetric and reflexive only.
Let R be a relation on defined by (a, b) R (c, d) if and only if is divisible by 5. Then R is [2024]
Reflexive but neither symmetric nor transitive
Reflexive, symmetric and transitive
Reflexive and transitive but not symmetric
Reflexive and symmetric but not transitive
(D)
...(i)
...(ii)
If R is the smallest equivalence relation on the set {1, 2, 3, 4} such that , then the number of elements in R is _______ . [2024]
12
15
10
8
(C)
To make R an equivalence relation, R should be reflexive, symmetric, and transitive.
R = {(1,1), (2,2), (3,3), (4,4), (1,2), (2,1), (1,3), (3,1), (3,2), (2,3)}
So, minimum number of elements in R should be 10.
Let A = {2, 3, 6, 7} and B = {4, 5, 6, 8}. Let R be a relation defined on by if and only if . Then the number of elements in R is ______________. [2024]
(25)
Hence, total number of elements =
Let A = {1, 2, 3,…,20}. Let and be two relation on A such that = {(a, b) : b is divisible by a} = {(a, b) : a is an integral multiple of b} Then, number of elements in is equal to _______ . [2024]
(46)
= {(1, 1), (1, 2)…(1, 20), (2, 2), (2, 4),…(2, 20), (3, 3), (3, 6)…(3, 18), (4, 4), (4, 8),…(4, 20), (5, 5), (5, 10), (5, 15), (5, 20), (6, 6), (6, 12), (6, 18), (7, 7), (7, 14), (8, 8), (8, 16), (9, 9), (9, 18), (10, 10), (10, 20), (11, 11), (12, 12), (13, 13), (14, 14), (15, 15), (16, 16), (17, 17), (18, 18), (19, 19), (20, 20)}
= {(20, 1), (20, 2), (20, 4), (20, 5), (20, 10), (20, 20), (19, 19), (19, 1), (18, 1), (18, 2), (18, 3), (18, 6), (18, 9), (18, 18), (17, 1), (17, 17), (16, 1), (16, 2), (16, 4), (16, 8), (16, 16), (15, 1), (15, 3), (15, 5), (15, 15), (14, 1), (14, 2), (14, 7), (14, 14), (13, 1), (13, 13), (12, 1), (12, 2), (12, 3), (12, 4), (12, 6), (12, 12), (11, 1), (11, 11), (10, 1), (10, 2), (10, 5), (10, 10), (9, 1), (9, 3), (9, 9), (8, 1), (8, 2), (8, 4), (8, 8), (7, 1), (7, 7), (6, 1), (6, 2), (6, 3), (6, 6), (5, 1), (5, 5), (4, 1), (4, 2), (4, 4), (3, 1), (3, 3), (2, 1), (2, 2), (1, 1)}
= {(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6), (7, 7), (8, 8), (9, 9), (10, 10), (11, 11), (12, 12), (13, 13), (14, 14), (15, 15), (16, 16), (17, 17), (18, 18), (19, 19), (20, 20)}
Number of elements in elements.
The number of symmetric relations defined on the set {1, 2, 3, 4} which are not reflexive is _______. [2024]
(960)
Let A = {1, 2, 3, 4}
Number of reflexive and symmetric relation
Number of symmetric relations
Number of relations which is symmetric but not reflexive
Let A = {1, 2, 3, 4} and R = {(1, 2), (2, 3), (1, 4)} be a relation on A. Let S be the equivalence relation on A such that and the number of elements in S is . Then, the minimum value of is ________. [2024]
(16)
Given A = {1, 2, 3, 4}
R = {(1, 2), (2, 3), (1, 4)}
S to be equivalence, it should be reflexive, symmetric and transitive.
For reflexive add (1, 1), (2, 2), (3, 3), (4, 4).
For symmetric add (2, 1), (3, 2), (4, 1).
For transitive (1, 2), (2, 3) (1, 3), so add (1, 3) also add (3, 1) for symmetric
and (4, 1), (1, 2) (4, 2), so add (4, 2) also add (2, 4) for symmetric.
∴ S = {(1, 2), (2, 3), (1, 4), (1, 1), (2, 2), (3, 3), (4, 4), (2, 1), (3, 2), (4, 1), (3, 1), (1, 3), (2, 4), (4, 2), (3, 4), (4, 3)}
∴ n(S) = 16
Let A = {1, 2, 3, ..........., 100}. Let R be a relation on A defined by (x, y) ∈ R if and only if 2x = 3y. Let be a symmetric relation on A such that and the number of elements in is . Then, the minimum value of is ______. [2024]
(66)
We have, A = {1, 2, 3, ..., 100}
R = {(3, 2), (6, 4), (9, 6), (12, 8), ....(99, 66)}
n(R) = 33
Since, is symmetric and
∴ n() = 66