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

Show that the relation $R$ in the set $A$ of all the books in a library of a college,given by $R = \{(x, y) : x \text{ and } y \text{ have the same number of pages} \}$ is an equivalence relation.

The empty relation on a set $A$ is

The relation $S$ in the set $R$ of real numbers,defined as $S = \{(a, b) : a < b^2\}$ is a . . . . . . relation.

Let $A = \{1, 2, 3\}$. Then the number of equivalence relations containing $(1, 2)$ is:

Let $A = \{-3, -2, -1, 0, 1, 2, 3\}$ and $R$ be a relation on $A$ defined by $x R y$ if and only if $2x - y \in \{0, 1\}$. Let $l$ be the number of elements in $R$. Let $m$ and $n$ be the minimum number of elements required to be added in $R$ to make it reflexive and symmetric relations,respectively. Then $l + m + n$ is equal to :-

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