For the set $A = \{1, 2, 3\}$,consider the relation $S = \{(1, 2), (2, 1), (2, 3)\}$ on $A$. Then,the relation $S$ is . . . . . . .

  • A
    not transitive
  • B
    symmetric
  • C
    reflexive
  • D
    an equivalence relation

Explore More

Similar Questions

Show that the relation $R$ in the set $\{1, 2, 3\}$ given by $R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)\}$ is reflexive but neither symmetric nor transitive.

Let $R_{1}$ and $R_{2}$ be two relations defined on the set of real numbers $\mathbb{R}$ by $a R_{1} b \iff ab \geq 0$ and $a R_{2} b \iff a \geq b$. Then:

On $R$, the set of real numbers, a relation $\rho$ is defined as $a \rho b$ if and only if $1+a b > 0$. Then,

Let $R$ be a relation defined on the set $\{1,2,3,4\} \times \{1,2,3,4\}$ by $R = \{((a,b), (c,d)) : 2a + 3b = 3c + 4d\}$. Then the number of elements in $R$ is:

The number of reflexive relations on a set $A$ of $n$ elements 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