On set $A = \{1, 2, 3\}$,relations $R$ and $S$ are given by $R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}$ and $S = \{(1, 1), (2, 2), (3, 3), (1, 3), (3, 1)\}$. Then,

  • A
    $R \cup S$ is an equivalence relation
  • B
    $R \cup S$ is reflexive and transitive but not symmetric
  • C
    $R \cup S$ is reflexive and symmetric but not transitive
  • D
    $R \cup S$ is symmetric and transitive but not reflexive

Explore More

Similar Questions

Let $R$ be an equivalence relation on a finite set $A$ having $n$ elements. Then the number of ordered pairs in $R$ is

Check whether the relation $R$ in $\mathbb{R}$ defined by $R = \{(a, b) : a \leq b^3\}$ is reflexive,symmetric,or transitive.

Let $R_{1}$ and $R_{2}$ be relations on the set $\{1, 2, \ldots, 50\}$ such that $R_{1} = \{(p, p^{n}) : p \text{ is a prime and } n \geq 0 \text{ is an integer}\}$ and $R_{2} = \{(p, p^{n}) : p \text{ is a prime and } n = 0 \text{ or } 1\}$. Then,the number of elements in $R_{1} - R_{2}$ is:

Let $A$ be the set of all students of a boys' school. Show that the relation $R$ in $A$ given by $R = \{(a, b) : a \text{ is sister of } b\}$ is the empty relation and $R^{\prime} = \{(a, b) : \text{the difference between heights of } a \text{ and } b \text{ is less than } 3 \text{ meters}\}$ is the universal relation.

Let $A = \{1, 2, 3, 4\}$ and $R = \{(1, 2), (2, 3), (1, 4)\}$ be a relation on $A$. Let $S$ be the smallest equivalence relation on $A$ such that $R \subset S$. If the number of elements in $S$ is $n$,then the value of $n$ 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