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

In order that a relation $R$ defined on a non-empty set $A$ is an equivalence relation,it is sufficient,if $R$

The relation "is subset of" on the power set $P(A)$ of a set $A$ is

Determine whether the following relation is reflexive,symmetric,and transitive:
Relation $R$ in the set $A$ of human beings in a town at a particular time given by $R = \{(x, y): x \text{ and } y \text{ work at the same place}\}$.

Let $f: X \rightarrow Y$ be a function. Define a relation $R$ in $X$ given by $R = \{(a, b) : f(a) = f(b)\}$. Examine if $R$ is an equivalence relation.

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