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:

  • A
    $16$
  • B
    $15$
  • C
    $14$
  • D
    $13$

Explore More

Similar Questions

The relation $R = \{(a, a), (b, b), (c, c), (a, b), (b, a)\}$ is defined on the set $A = \{a, b, c\}$. Then $R$ is . . . . . . .

On the set of all real numbers,a relation $R$ is defined as $a \, R \, b$ if and only if $|a - b| \le 1$. Then $R$ is:

The relation "less than" in the set of natural numbers 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 "congruence modulo $m$" 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