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

  • A
    $2$
  • B
    $1$
  • C
    $3$
  • D
    $4$

Explore More

Similar Questions

Show that the relation $R$ defined in the set $A$ of all polygons as $R = \{(P_{1}, P_{2}) : P_{1} \text{ and } P_{2} \text{ have the same number of sides}\}$,is an equivalence relation. What is the set of all elements in $A$ related to the right-angled triangle $T$ with sides $3, 4, \text{ and } 5$?

On the set $R$ of real numbers, we define $x P y$ if and only if $x y \geq 0$. Then, the relation $P$ is

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

Let $R$ be a relation on $N \times N$ defined by $(a, b) R (c, d)$ if and only if $ad(b-c) = bc(a-d)$. Then $R$ is

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

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