GATE | GATE-CS-2001 | Question 29 - GeeksforGeeks

28 Jun, 2021
Consider the following relations:
R1(a,b) iff (a+b) is even over the set of integers
R2(a,b) iff (a+b) is odd over the set of integers
R3(a,b) iff a.b > 0 over the set of non-zero rational numbers
R4(a,b) iff |a - b| <= 2 over the set of natural numbers
Which of the following statements is correct?(A) R1 and R2 are equivalence relations, R3 and R4 are not(B) R1 and R3 are equivalence relations, R2 and R4 are not(C) R1 and R4 are equivalence relations, R2 and R3 are not(D) R1, R2, R3 and R4 are all equivalence relationsAnswer: (B)Explanation: So basically, we have to tell whether these relations are equivalence or not.
R1(a,b)Reflexive : Yes, because (a+a) is even.Symmetrix : Yes, (a+b) is even ⟹ (b+a) is even.Transitive : Yes, because (a+b) is even and (b+c) is even ⟹ (a+c) is even.So R1 is equivalence relation.R2(a,b)Reflexive : No, because (a+a) is even.So R2 is not equivalence relation.R3(a,b)Reflexive : Yes, because a.a > 0.Symmetrix : Yes, a.b > 0 ⟹ b.a > 0.Transitive : Yes, because a.b > 0 and b.c > 0 ⟹ a.c > 0.So R3 is equivalence relation.R4(a,b)Reflexive : Yes, because |a-a| ≤ 2.Symmetrix : Yes, |a-b| ≤ 2 ⟹ |b-a| ≤ 2.Transitive : No, because |a-b| ≤ 2 and |b-c| ≤ 2 ⇏ (a-c) is even.So R4 is not equivalence relation.
R1(a,b)Reflexive : Yes, because (a+a) is even.Symmetrix : Yes, (a+b) is even ⟹ (b+a) is even.Transitive : Yes, because (a+b) is even and (b+c) is even ⟹ (a+c) is even.So R1 is equivalence relation.
Reflexive : Yes, because (a+a) is even.
Symmetrix : Yes, (a+b) is even ⟹ (b+a) is even.
Transitive : Yes, because (a+b) is even and (b+c) is even ⟹ (a+c) is even.
So R1 is equivalence relation.
R2(a,b)Reflexive : No, because (a+a) is even.So R2 is not equivalence relation.
Reflexive : No, because (a+a) is even.
So R2 is not equivalence relation.
R3(a,b)Reflexive : Yes, because a.a > 0.Symmetrix : Yes, a.b > 0 ⟹ b.a > 0.Transitive : Yes, because a.b > 0 and b.c > 0 ⟹ a.c > 0.So R3 is equivalence relation.
Reflexive : Yes, because a.a > 0.
Symmetrix : Yes, a.b > 0 ⟹ b.a > 0.
Transitive : Yes, because a.b > 0 and b.c > 0 ⟹ a.c > 0.
So R3 is equivalence relation.
R4(a,b)Reflexive : Yes, because |a-a| ≤ 2.Symmetrix : Yes, |a-b| ≤ 2 ⟹ |b-a| ≤ 2.Transitive : No, because |a-b| ≤ 2 and |b-c| ≤ 2 ⇏ (a-c) is even.So R4 is not equivalence relation.
Reflexive : Yes, because |a-a| ≤ 2.
Symmetrix : Yes, |a-b| ≤ 2 ⟹ |b-a| ≤ 2.
Transitive : No, because |a-b| ≤ 2 and |b-c| ≤ 2 ⇏ (a-c) is even.
So R4 is not equivalence relation.
So option (b) is correct..
Source: http://www.cse.iitd.ac.in/~mittal/gate/gate_math_2001.htmlQuiz of this Question
GATE-CS-2001
GATE-GATE-CS-2001
GATE
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Comments
Old Comments
GATE | GATE-CS-2016 (Set 2) | Question 48
GATE | GATE-CS-2014-(Set-1) | Question 30
GATE | GATE-CS-2001 | Question 23
GATE | GATE-CS-2015 (Set 1) | Question 65
GATE | GATE CS 2010 | Question 45
GATE | GATE-CS-2015 (Set 3) | Question 65
GATE | GATE-CS-2015 (Set 1) | Question 42
GATE | GATE-CS-2014-(Set-1) | Question 65
C++ Program to count Vowels in a string using Pointer
GATE | GATE-CS-2004 | Question 3