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

  • A
    $1$
  • B
    $3$
  • C
    $2$
  • D
    $4$

Explore More

Similar Questions

Let $P = \{ (x, y) | x^2 + y^2 = 1, x, y \in \mathbb{R} \}$. Then $P$ is:

The number of symmetric relations defined on the set $\{1, 2, 3, 4\}$ which are not reflexive is

Let $N$ denote the set of all natural numbers and $R$ be the relation on $N \times N$ defined by $(a, b) R (c, d)$ if $ad(b + c) = bc(a + d),$ then $R$ is

Difficult
View Solution

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 is given by:
$R = \{(x, y) : x \text{ and } y \text{ live in the same locality}\}$

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

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