Discrete Mathematics Questions and Answers - Number of Relations « Prev Next » This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Number of Relations”. 1. How many binary relations are there on a set S with 9 distinct elements? a) 290 b) 2100 c) 281 d) 2° View Answer Answer: c Explanation: S is the set with 9 elements. A relation on S is defined as S x S. There are 92 number of ordered pairs in relation. So, the number of binary relations is 2° = 281.2. number of reflexive relations are there on a set of 11 distinct elements. a) 2110 b) 3121 ¢) 290 d) 2132 * View Answer Answer: a Explanation: Let A be a set consists of n distinct elements. There are 2(*n)-n number of reflexive relations that can be formed. So, here the answer is 2(11*11)-11 = 2110, 3. The number of reflexive as well as symmetric relations on a set with 14 distinct elements is a) 4120 b) 27° ¢) 3201 d) 291 * View Answer Answer: d Explanation: Let A be a set consists of n distinct elements. There are 2(*(r-Wy2 number of reflexive and symm relations that can be formed. So, here the answer is 2'4*14-1)/2 = 991,4. The number of symmetric relations on a set with 15 distinct elements is a) 21 96 b) 290 c) 2320 d) 278 Answer: a Explanation: Let S be a set consists of n distinct elements. There are 2!U*(r-1) number of reflexive and symmetric relations that can be formed. So, here the answer is 2(19-1*(19-1) = 2196,5. Suppose S is a finite set with 7 elements. How many elements are there in the largest equivalence relation on S? a) 56 b) 78 c) 49 d) 100 View Answer Answer: ¢ Explanation: Let R is an equivalence relation on the set S and so it satisfies the reflexive, symmetric and __ transitive property. The largest equivalence relation means it should contain the largest number of ordered pairs. Since we can have n? ordered pairs in R x R where n belongs to S and all these ordered pairs are present in this relation; its the largest equivalence relation.So there are n? elements i.e 77 = 49 elements in the largest equivalence relation.6. is the rank of the largest equivalence relation on a set of 20 elements. a) 320 b) 2400 c) 20 d) 1 “ view Answer Answer: d Explanation: The rank of an equivalence relation is the number of an equivalence classes. If we have aj, a2, a3, ..., a, elements then a, and a) will be in the same equivalence class because everything is related and so on. In this case, there is only one equivalence class.7. How many elements are there in the smallest equivalence relation on a set with 8 elements? a) 102 b) 8 c) 48 d) 32 A view Answer Answer: b Explanation: Let R is an equivalence relation on the set S with n elements and so it satisfies reflexive, symmetric and transitive properties. The smallest equivalence relation means it should contain minimum number of ordered pairs i.e along with symmetric and transitive properties it must always satisfy reflexive property. So, the smallest equivalence relation will have n ordered pairs and so the answer is 8.8. The rank of smallest equivalence relation on a set with 12 distinct elements is a) 12 b) 144 c) 136 d)79 view Answer Answer: a Explanation: In the case of smallest equivalence relation, each element is in one equivalence class like {a;}, {a}, ... are equivalence classes. So, the rank or number of equivalence classes is n for a set with n elements and so the answer is 12.9, If aset A has 8 elements and a set B has 10 elements, how many relations are there from Ato B? a) 290 b) 380 c) 164 d) 280 “ View Answer Answer: d Explanation: Let, a relation R from A to B is a subset of AxB. As the maximum number of subsets (Elements in the powerset) is 2™ there are 2™" number of relations from A to B and so the answer is 2°°.10. Synonym for binary relation is a) equivalence relation b) dyadic relation c) orthogonal relation d) one to many relations A view Answer Answer: b Explanation: A binary relation on a set S is a set of ordered pairs of elements of S. It is a subset of the cartesian product S? = S x S. The terms correspondence, dyadic relation and 2-place relation are synonyms for the binary relation.Discrete Mathematics Questions and Answers - Closure on Relations « Prev Next » This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Closure on Relations”. 1. R is a binary relation on a set S and R is reflexive if and only if a) r(R)=R b) s(R)=R c)t(R)=R d) f(R)=R View Answer Answer: a Explanation: Let reflexive closure of R:r(R) = R. If R is reflexive, it satisfies all the condition in the definition of reflexive closure. So, a reflexive closure of a relation is the smallest number of reflexive relation contain in R. Hence, R = r(R).2. If Ry and R2 are binary relations from set A to set B, then the equality___—__—holds. a) (RIS = RS b) (Ax B/S =@ c) (Ry U Ra) = RyS U RS d) (Ry U Ra) = Ryo RoE View Answer Answer: c Explanation: To proof (Rj U R2)° = Ryo U R,S, if belongs to (Rj U R2)° e € (Ry U Ro) @ € R; or © Rp & & RS or © Ro& e & RiS U Ro. 3. The condition for a binary relation to be symmetric is a) s(R)=R b)RUR=R c)R=RS d) f(R) =R View Answer Answer: c Explanation: If € R then € R, where a and b belong to two different sets and so its symmetric. R‘ also contains RS=R, “aw4. ____ number of reflexive closure exists in a relation R = {(0,1), (1,1), (1,3), (2,1), (2,2), (3,0)} where {0, 1, 2, 3} EA. a) 2° b)6 c)8 d) 36 A View Answer Answer: b Explanation: The reflexive closure of R is the relation, R U A = { (a,b) | (a,b) R (a,a) | a A }. Hence, R U A = {(0,1), (1,1), (1,3), (2,1), (2,2), (3,0)} and the answer is 6.5. The transitive closure of the relation {(0,1), (1,2), (2,2), (3,4), (5,3), (5,4)} on the set {1, 2, 3, 4, 5} is a) {(0,1), (1,2), (2,2), (3,4)} b) {(0,0), (1,1), (2,2), (3,3), (4,4), (5,5)} c) {(0,1), (1,1), (2,2), (5,3), (5,4)} d) {(0,1), (0,2), (1,2), (2,2), (3,4), (5,3), (5,4)} View Answer Answer: d Explanation: Let R be a relation on a set A. The connectivity relation on R* consists of pairs (a,b) such that there is a path of length at least one from a to b in R. Mathematically, R* = R' UR UR? U... UR". Hence the answer is {(0,1), (0,2), (1,2), (2,2), (3,4), (5,3), (5,4)}.6. Amongst the properties {reflexivity, symmetry, antisymmetry, transitivity} the relation R={(a,b) € N? | al= b} satisfies property. a) symmetry b) transitivity c) antisymmetry d) reflexivity A View Answer Answer: a Explanation: It is not reflexive as aRa is not possible. It is symmetric as if aRb then bRa. It is not antisymmetric as aRb and bRa are possible and we can have al=b. It is not transitive as if aRb and bRc then aRc need not be true. This is violated when c=a. So the answer is symmetry property.7. The number of equivalence relations of the set (3,6,9,12,18}is a)4 b) 2° c) 22 d) 90 View Answer Answer: a Explanation: Number of equivalence Relations are given by BELL number. The nth of these numbers i.e, B, counts the number of different ways to partition a set that has exactly n elements, or equivalently, the number of equivalence relations on it. Let’s say, 1 > Equivalence relation with 1 element; 1 2 -> Equivalence relation with 2 element; 2 3 5 -> Equivalence relation with 3 element; 5 7 10 15 -> Equivalence relation with 4 element. Hence, the answer is 4,8. Let R; and R2 be two equivalence relations on a set, Is Rj U R2 an equivalence relation? a) an equivalence relation b) reflexive closure of relation c) not an equivalence relation d) partial equivalence relation view Answer Answer: a Explanation: R; union R2 is not equivalence relation because transitivity property of closure need not hold. For instance, (x, y) can be in R; and (y, z) be in R2 and (x, z) not in either R; or Ro. However, R; intersection R2 is an equivalence relation.9. A relation R is defined on the set of integers as aRb if and only if a+b is even and Ristermedas___ a) an equivalence relation with one equivalence class b) an equivalence relation with two equivalence classes c) an equivalence relation d) an equivalence relation with three equivalence classes A View Answer Answer: b Explanation: R is reflexive as (a+b) is even for any integer; R is symmetric as if (a+b) is even (b+a) is also even; R is transitive as if ((at+b)+c) is even, then (a+(b+c)) is also even. So, R is an equivalence relation. For set of natural numbers, sum of even numbers always give even, sum of odd numbers always give even and sum of any even and any odd number always give odd. So, must have two equivalence classes -> one for even and one for odd. {..., -4, -2, 0, 2, ... }and {..., -3, -1, 1, 3, ... }.10. The binary relation U = ® (empty set) ona setA={11,23,35}is_ a) Neither reflexive nor symmetric b) Symmetric and reflexive c) Transitive and reflexive d) Transitive and symmetric View Answer Answer: d Explanation: U = ® (empty set) on a set A= {11, 23, 35} need to be hold Irreflexive, symmetric, anti-symmetric, asymmetric and transitive closure property, but it is not Reflexive as it does not contain any self loop in itself.Questions and Answers - Types of Relations « Prev Next » This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Types of Relations”. 1. The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is a) reflective, symmetric and transitive b) irreflexive, symmetric and transitive c) neither reflective, nor irreflexive but transitive d) irreflexive and antisymmetric View Answer Answer: c Explanation: Not reflexive -> (3,3) not present; not irreflexive -> (1, 1) is present; not symmetric -> (2, 1) is present but not (1, 2); not antisymmetric - (2, 3) and (3, 2) are present; not asymmetric -> asymmetry requires both antisymmetry and irreflexivity. So, it is transitive closure of relation.2. Consider the relation: R’ (x, y) if and only if x, y>O over the set of non-zero rational numbers,then R’ is a) not equivalence relation b) an equivalence relation c) transitive and asymmetry relation d) reflexive and antisymmetric relation A View Answer Answer: b Explanation: Reflexive: a, a>0 Symmetric: if a, b>O then both must be +ve or -ve, which means b, a > 0 also exists Transitive: if a, b>O and b, c>0 then to have b as same number, both pairs must be +ve or -ve which implies a, c>O. Hence, R’ is an equivalence relation.3. Let S be a set of n>0 elements. Let be the number B, of binary relations on S and let By be the number of functions from S to S. The expression for B, and By, in terms of n should be a) n? and 2(n+1)? b) n? and n'™*) c) n and n'"*6) d) 2°") and n” View Answer Answer: d Explanation: For a set with n elements the number of binary relations should be 2!*") and the number of functions should be n". Hence B, = 2!) and B,; =n".4. Let A be a set of k (k>0) elements. Which is larger between the number of binary relations (say, N,;) on A and the number of functions (say, N») from A to A? a) number of relations b) number of functions c) the element set d) number of subsets of the relation A View Answer Answer: a Explanation: For a set with k elements the number of binary relations should be 2'"” and the number of functions should be n". Now, 2°") => n?log (2) [taking log] and n" => nlog (n) [taking log]. It is known that n2log (2) > nlog (n). Hence, the number of binary relations > the number of functions i.e, Np > Ne.5. Consider the binary relation, A = {(a,b) | b= a - 1 and a, b belong to {1, 2, 3}}. The reflexive transitive closure of A is? a) {(a,b) | a>=b and a, b belong to {1, 2, 3}} b) {(a,b) | a > b and a, b belong to {1, 2, 3}} c) {(a,b) | a<= band a, b belong to {1, 2, 3}} d) {(a,b) | a= band a, b belong to {1, 2, 3}} A View Answer Answer: a Explanation: By definition of Transitive closure we have that a is related to all smaller b (as every a is related to b - 1) and from the reflexive property a is related to a.6. Let R; be a relation from A = {1, 3, 5, 7} to B = {2, 4, 6, 8} and R2 be another relation from B to C= {1, 2, 3, 4} as defined below: ij. An element a in A is related to an element b in B (under Rj) if a * b is divisible by 3. ii. An element a in B is related to an element b in C (under R32) if a * b is even but not divisible by 3. Which is the composite relation RiR2 from A to C? a) RyR2 = {(1, 2), (1, 4), (3, 3), (5, 4), (5,6), (7, 3)} b) ® c) RiR2 = {(1, 2), (1,6), (3, 2), (3, 4), (5, 4), (7, 2)} d) RyRo = {(2,2), (3, 2), (3, 4), (5, 1), (5, 3), (7, 1)} View Answer Answer: b Explanation: By definition, i) R; = {(1,6), (3,2), (3,4), (3,6), (3,8), (5,6), (7,6)} and ii) Ro = {(1,2), (1,4), (1,8), (5,2), (5,4), (5,8), (7,2), (7,4), (7,8)}. So, RyRo = ®.7. The time complexity of computing the transitive closure of a binary relation on a set of n elements should be a) O(n) b) O(logn) c) o(nin*/2)) d) O(n?) View Answer Answer: d Explanation: Calculation of transitive closure results into matrix multiplication. We can do matrix multiplication in O(n?) time. There are better algorithms that do less than cubic time.8. Let A and B be two non-empty relations on a set S. Which of the following statements is false? a) Aand B are transitive = ANB is transitive b) A and B are symmetric + AUB is symmetric c) A and B are transitive + AUB is not transitive d) Aand B are reflexive = ANB is reflexive View Answer Answer: c Explanation: In terms of set theory, the binary relation R defined on the set X is a transitive relation if, for all a, b, c € X, if aRb and bRc, then aRc. If there are two relations on a set satisfying transitive property then there union must satisfy transitive property.9. Determine the characteristics of the relation aRb if a* = b?. a) Transitive and symmetric b) Reflexive and asymmetry c) Trichotomy, antisymmetry, and irreflexive d) Symmetric, Reflexive, and transitive A view Answer Answer: d Explanation: Since, x* = y? is just a special case of equality, so all properties that apply to x = y also apply to this case. Hence, the relation satisfies symmetric, reflexive and transitive closure.10. Let R be a relation between A and B. R is asymmetric if and only if a) Intersection of D(A) and R is empty, where D(A) represents diagonal of set b) R' is a subset of R, where R™ represents inverse of R c) Intersection of R and R™ is D(A) d) D(A) is a subset of R, where D(A) represents diagonal of set A view Answer Answer: a Explanation: A relation is asymmetric if and only if it is both antisymmetric and irreflexive. As a consequence, a relation is transitive and asymmetric if and only if it is a strict partial order. If D(A) is a diagonal of A set and intersection of D(A) and R is empty, then R is asymmetric. —Answers - Relations - Partial Orderings « Prev Next » This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Relations - Partial Orderings”. 1. Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S <= R if a divides b. Number of edges in the Hasse diagram of is a)6 b)5 9 d)4 View Answer Answer: b Explanation: Hasse Diagram is:So, the number of edges should be: 4. 2. The less-than relation, <, on a set of real numbersis a) not a partial ordering because it is not asymmetric and irreflexive equals antisymmetric b) a partial ordering since it is asymmetric and reflexive c) a partial ordering since it is antisymmetric and reflexive d) not a partial ordering because it is not antisymmetric and reflexive View Answer Answer: a Explanation: Relation less than a set of real numbers is not antisymmetric and reflexive. Relation is not POSET because it is irreflexive. Again, aRb != bRa unless a=b and so it is antisymmetric. A relation may be ‘not asymmetric and not reflexive but still antisymmetric, as {(1,1) (1,2)}. So, the relation is not a partial ordering becau is not asymmetric and irreflexive el antisymmetric.3. If the longest chain in a partial order is of length I, then the partial order can be written as__ disjoint antichains. a) I? b) |+1 c)| d) | “ view Answer Answer: c Explanation: If the length of the longest chain in a partial order is |, then the elements in the POSET can be partitioned into | disjoint antichains.4. Suppose X = {a, b, c, d} and T, is the partition of X, m1, = {{a, b, c}, d}. The number of ordered pairs of the equivalence relations induced by a) 15 b) 10 c) 34 d)5 view Answer Answer: b Explanation: The ordered pairs of the equivalence relations induced = {(a,a), (a,b), (a,c), (b,a), (,b), (b,c), (ca), (C,b), (c,c), (d.d)}. Poset -> equivalence relations = each partition power set - ®.5. A partial order P is defined on the set of natural numbers as follows. Here a/b denotes integer division. i)(0, 0) € P. ii)(a, b) € P if and only if a % 10 < b % 10 and (a/10, b/10) € P. Consider the following ordered pairs: i. (101, 22) ii. (22, 101) iii. (145, 265) iv. (0, 153) The ordered pairs of natural numbers are containedinPare__s and a) (145, 265) and (0, 153) b) (22, 101) and (0, 153) c) (101, 22) and (145, 265) d) (101, 22) and (0, 153) * View Answer Answer: d Explanation: For ordered pair (a, b), to be in P, each digit in a starting from unit place must not be larger than the corresponding digit in b. This condition is satisfied by options (iii) (145, 265) => 5<5,4<6and1< 2; (iv) (0, 153) => 0 < 3 and no need to examine further.6. The inclusion of ___ sets into R = {{1, 2}, {1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4, 5}} is necessary and sufficient to make R a complete lattice under the partial order defined by set containment. a) {1}, {2, 4} b) {1}, {1, 2, 3} c) {1} d) {1}, {1, 3}, {1, 2, 3, 4}, {1, 2, 3, 5} View Answer Answer: C Explanation: A lattice is complete if every subset of partial order set has a supremum and infimum element. For example, here we are given a partial order set R. Now it will be a complete lattice if whatever be the subset we choose, it has a supremum and infimum element. Here relation given is set containment, so supremum element will be just union of all sets in the subset we choose. Similarly, the infimum element will be just an intersection of all the sets in the subset we choose. As R now is not complete lattice, because although it has a supremum for every subset we choose, but some subsets have no_ infimum. For example, if we take subset {{1, 3, 5}, {1 4}}, then intersection of sets in this is fi@® which is not present in R. So clearly, if we add set {1} in R, we will solve the problem.So adding {1} is necessary and sufficient condition for R to be a complete lattice.7. Consider the ordering relation a | bO&N x N over natural numbers N such that a | b if there exists c belong to N such that a*c=b. Then a) | is an equivalence relation b) It is a total order c) Every subset of N has an upper bound under | d) (N, |) is a lattice but not a complete lattice A view Answer Answer: d Explanation: A set is called lattice if every finite subset has a least upper bound and greatest lower bound. It is termed as a complete lattice if every subset has a least upper bound and greatest lower bound. As every subset of this will not have LUB and GLB so (N,]) is a lattice but not a complete lattice.8. Consider the set N* of finite sequences of natural numbers with a denoting that sequence a is a prefix of sequence b. Then, which of the following is true? a) Every non-empty subset of has a greatest lower bound b) It is uncountable c) Every non-empty finite subset of has a least upper bound d) Every non-empty subset of has a least upper bound A View Answer Answer: a Explanation: Consider any sequence like “45, 8, 7, 2" — it can have many (infinite) least upper bounds like “45, 8, 7, 2, 5”, “45, 8, 7, 2, 1" and so on but it can have only 1 greatest lower bound - “45, 8, 7" because we are using the prefix relation. So, every non-empty subset has a greatest lower bound.9. A partial order < is defined on the set S = {x, by, ba, ... Dy, y} as x < bj for all i and bj < y for all i, where n 2 1. The number of total orders on the set S which contain the partial ordersis a) n+4 b) n? c)n! d)3 A View Answer Answer: ¢ Explanation: To make this partial order a total order, we need the relation to hold for every two element of the partial order. Currently, there is no relation between any bj and bj. So, for every b; and bj, we have to add either (bj, bj) or (bj, b;) in total order. So, this translates to giving an ordering for n elements between x and y, which can be done in n! ways. a10. Let (A, <) be a partial order with two minimal elements a, b and a maximum element c. Let P:A -> {True, False} be a predicate defined on A. Suppose that P(a) = True, P(b) = False and P(a) = P(b) for all satisfying a s b, where = stands for logical implication. Which of the — following statements cannot be true? a) P(x) = True for all x S such that x #b b) P(x) = False for all x € S such that b < x and X#C c) P(x) = False for all x € S such that x # a and X#C d) P(x) = False for all x © S such that a < x and b canno true. P(x) = True for all x S such that x # can be True as all elements mapped to TRUE doesn't violate the given implication.P(x) = False for all x € S such that x # a and x # c -> can be True if a is related only to c. P(x) = False for all x © S such that b < x and x # c -> can be True as bsx ensures x#a and for all other elements P(x) can be False without violating the given implication.Questions and Answers - Relations - Equivalence Classes and Partitions « Prev Next » This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Relations - Equivalence Classes and Partitions”. 1. Suppose a relation R = {(3, 3), (5, 5), (5, 3), (5, 5), (6, 6)} on S = {3, 5, 6}. Here R is known as a) equivalence relation b) reflexive relation c) symmetric relation d) transitive relation * View Answer Answer: a Explanation: Here, [3] = {3, 5}, [5] = {3, 5}, [5] = {5}. We can see that [3] = [5] and that S/R will be {[3], [6]} which is a partition of S. Thus, we can choose either {3, 6} or {5, 6} as a set of representatives of the equivalence classes.2. Consider the congruence 45=3(mod 7). Find the set of equivalence class representatives. a) {..., 0, 7, 14, 28, ...} b) {..., -3, 0, 6, 21, ...} c) {..., 0, 4, 8, 16, ...} d) {..., 3, 8, 15, 21, ...} view Answer Answer: a Explanation: Note that a set of class representatives is the subset of a set which contains exactly one element from each equivalence class. Now, for integers n, a and b, we have congruence a=b(mod n), then the set of equivalence classes are {..., -2n, -n, 0, n, 2n,...}, {.., 1-2n, 1-n, 1, 1+Nn, 1+2n,...}. The required answer is {..., 0, 7, 14, 28, ...}.3. Which of the following relations is the reflexive relation over the set {1, 2, 3, 4}? a) {(0,0), (1,1), (2,2), (2,3)} b) {(1,1), (1,2), (2,2), (3,3), (4,3), (4,4)} c) £(1,1), (1,2), (2,1), (2,3), (3,4)} d) {(0,1), (1,1), (2,3), (2,2), (3,4), (3,1) A View Answer Answer: b Explanation: {(1,1), (1,2), (2,2), (3,3), (4,3), (4,4)}} is a reflexive relation because it contains set = {(1,1), (2,2), (3,3), (4,4)}.4. Determine the partitions of the set {3, 4, 5, 6, 7} from the following subsets, a) {3,5}, {3,6,7}, {4,5,6} b) {3}, {4,6}, {5}, {7} C) {3,4,6}, {7} d) {5,6}, {5,7} A view Answer Answer: b Explanation: {3,5}, {3,6,7}, {4,5,6}. It is not a partition because these sets are not pairwise disjoint. The elements 3, 5 and 6 appear repeatedly these sets. {1}, {2,3,6}, {4}, {5} - this is a partition as they are pairwise disjoint. {3,4,6}, {7} - this is not a partition as element 5 is missing. {5,6}, {5,7} — this is not a partition because it is missing the elements 3, 4 in any of the sets.5. Determine the number of equivalence classes that can be described by the set {2, 4, 5}. a) 125 b)5 c) 16 d) 72 A View Answer Answer: b Explanation: Suppose B={2, 4, 5} and BxB = (2,2), (4,4), (5,5), (2,4), (4,2), (4,5), (5,4), (2,5), (5,2). A relation R on set B is said to be equivalence relation if R is reflexive, Symmetric, transitive. Hence, total number of equivalence relation=5 out of 27=8 relations.6. Determine the number of possible relations in an antisymmetric set with 19 elements. a) 23585 b) 2.02 * 1087 c) 9.34 * 79" d) 35893 A View Answer Answer: b Explanation: Number of antisymmetric relation is given:-|A|=n, |AxA|=n xn. Then, N=total number of diagonal will n and we know that N = 2" * 3("nV/2_ So the number of relations should be = 2.02 * 108”.7. For a, b € Z define a | b to mean that a divides b is a relation which does not satisfy a) irreflexive and symmetric relation b) reflexive relation and symmetric relation c) transitive relation d) symmetric relation “ view Answer Answer: b Explanation: Suppose, a=0, then we know that 0 does not divide 0, 0 ¢ O and it is not reflexive. Again, 2 | 4 but 4 does not 2 and so it is not a symmetric relation.8. Which of the following is an equivalence relation on R, for a, b € Z? a) (a-b) © Z b) (a2+c) EZ c) (ab+cd)/2 € Z d) (2c3)/3 EZ View Answer Answer: b Explanation: Let a€ R, then a-a=O and0€ Z, so it is reflexive. To see that a-b € Z is symmetric, then a-b € Z -> say, a-b = m, where m€Z = b-a=-(a-b)=-m and -—m € Z. Thus, a-b is symmetric. To see that a-b is transitive, let a, b, c € R. Thus, a-b € Z; b-c € Z. Let a-b =i and b-c =j, for integers i,j © Z. Then a-c ='(a—b)+(b-c)=i + j. So, a-c € Z. Therefore a - c is transitive. Hence, (a-b) is an equivalence relation on the set R. Rest of the options are not equivalence relations.