Short Answer TypeR = {(a, b) : a ≤ b2}
(i) Since (a, a) ∉ R
∴ R is not reflexive.
(ii) Also (a, b) ∈ R ⇏ (b, a) ∈ R
[Take a = 2 ,b = 6, then 2 ≤ 62 but (6)2 < 2 is not true]
∴ R is not symmetric.
(iii) Now (a, b), (b, c) ∈ R ∉ (a, c) ∈ R
[Take a = 1, b = – 2, c = – 3 ∴ a ≤ b2 . b ≤ c2 but a ≤ c2 is not true) ∴ R is not transitive.
Let R be the relation in the set N given by R = {(a, b) : a = b – 2, b > 6}.
Choose the correct answer.
(A) (2. 4) ∈ R (B) (3, 8) ∈ R (C) (6,8) ∈ R (D)(8,7) ∈ R
Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is
(A) 1 (B) 2 (C) 3 (D) 4
Switch
