R = {(a, b) : a ≤ b}
(i) Since (a, a) ∈ R ∀ a ∈ R [∵ a ≤ a ∀ a ∈ R]
∴ R is reflexive.
(ii) (a, b) ∈ R ⇏ (b, a) ∈ R [∵ if a ≤ b. then b ≤ a is not true]
∴ R is not symmetric.
(iii) Let (a, b), (b, c) ∈ R ∴ a ≤ b, b ≤ c ∴ a ≤ c ⇒ (a, c) ∈ R ∴ (a, b), (b. c) ∈ R ⇒ (a, c) ∈ R ∴ R is 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