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

Give an example of a relation that is symmetric and transitive but not reflexive.

Let $R$ be a relation over the set $N \times N$ and it is defined by $(a, b)R(c, d) \iff a + d = b + c$. Then $R$ is

Difficult
View Solution

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

Let $R$ be a relation on the set $A$ of ordered pairs of positive integers defined by $(x, y) R (u, v)$ if and only if $xv = yu$. Show that $R$ is an equivalence relation.

The relation $R = \{(a, b) : \operatorname{gcd}(a, b) = 1, 2a \neq b, a, b \in \mathbb{Z}\}$ 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