Let $R$ be an equivalence relation defined on a set containing $6$ elements. The minimum number of ordered pairs that $R$ should contain is

  • A
    $12$
  • B
    $6$
  • C
    $64$
  • D
    $36$

Explore More

Similar Questions

Give an example of a relation on a set $A = \{4, 6, 8\}$ which is reflexive and symmetric but not transitive.

Let the relation $\rho$ be defined on $\mathbb{R}$ by $a \rho b$ if and only if $a-b$ is zero or irrational. Then:

The relation $S$ in the set $R$ of real numbers,defined as $S = \{(a, b) : a < b^2\}$ is a . . . . . . relation.

Let $A = \{1, 2, 3, 4, 5\}$. $A$ relation $R$ on $A$ is defined by $R = \{(x, y) | x, y \in A \text{ and } x < y\}$. Then $R$ is:

Let $A = \{1, 2, 3, 4\}$ and $R = \{(2, 2), (3, 3), (4, 4), (1, 2)\}$ be a relation on $A$. Then $R$ 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