For a set $A = \{1, 2, 3\}$,a relation $R = \{(1, 2), (2, 3)\}$ is defined. What is the minimum number of ordered pairs that must be added to $R$ to make it an equivalence relation?

  • A
    $5$
  • B
    $6$
  • C
    $7$
  • D
    $8$

Explore More

Similar Questions

Let $A = \{a, b, c\}$. The number of equivalence relations on $A$ containing $(b, c)$ is:

For any two real numbers $a$ and $b$, we define $a R b$ if and only if $\sin ^{2} a+\cos ^{2} b=1$. The relation $R$ is

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,

The relation $R$ defined in the set of natural numbers $N$ as $aRb \iff b$ is divisible by $a$ is:

Let $A$ be a set consisting of $10$ elements. The number of non-empty relations from $A$ to $A$ that are reflexive but not symmetric 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