Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then R is

1 min read

Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then R is

A

reflexive but not symmetric

B

reflexive but not transitive

C

symmetric and transitive

D

neither symmetric, nor transitive

Answer:

The correct option is A. reflexive but not symmetric

Note

Copy

You may like these posts

The binary operation * defined on N by a * b = a + b + ab for all a, b ∈ N is
The number of commutative binary operation that can be defined on a set of 2 elements is
The maximum number of equivalence relations on the set A = {1, 2, 3} are
Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ∀ a, b ∈ T. Then R is
Let us define a relation R in R as aRb if a ≥ b. Then R is
Let * be a binary operation on set Q – {1} defind by a * b = a + b – ab : a, b ∈ Q – {1}. Then * is

Post a Comment