Consider the following two binary relations on the set $A = \{a, b, c\}$: $R_1 = \{(c, a), (b, b), (a, c), (c, c), (b, c), (a, a)\}$ and $R_2 = \{(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)\}$. Then

  • A
    $R_2$ is symmetric but it is not transitive
  • B
    Both $R_1$ and $R_2$ are transitive
  • C
    Both $R_1$ and $R_2$ are not symmetric
  • D
    $R_1$ is not symmetric but it is transitive

Explore More

Similar Questions

$A$ relation $R$ on a non-empty set $A$ is an equivalence relation if $R$ is:

Let $A = \{1, 2, 3, 4\}$ and $R$ be a relation on $A$,given by $R = \{(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 1), (3, 1), (1, 3)\}$. Then $R$ is:

Give an example of a relation that is symmetric and transitive but not reflexive.

Let $R = \{ (3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6) \}$ be a relation on the set $A = \{ 3, 6, 9, 12 \}$. The relation is

Let $R$ be a relation on $\mathbb{Z} \times \mathbb{Z}$ defined by $(a, b) R (c, d)$ if and only if $ad - bc$ is divisible by $5$. Then $R$ is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo