Let $A = \{1, 2, 3\}$. The number of relations containing $(1, 2)$ and $(1, 3)$ which are reflexive and symmetric but not transitive is:

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

Explore More

Similar Questions

$A$ relation $\rho$ on the set of real numbers $\mathbb{R}$ is defined as $\{x \rho y : xy > 0\}$. Then,which of the following is/are true?

Let $A = \{-4, -3, -2, 0, 1, 3, 4\}$ and $R = \{(a, b) \in A \times A : b = |a| \text{ or } b^2 = a + 1\}$ be a relation on $A$. Then the minimum number of elements that must be added to the relation $R$ so that it becomes reflexive and symmetric is $........$.

Relation $R = \{(a, b): a < b\}$ is defined on the set of real numbers. Then $R$ is . . . . . . .

Let $R = \{(x, y) \in N \times N : \log_e(x + y) \leq 2\}$. Then the minimum number of elements,required to be added in $R$ to make it a transitive relation,is . . . . . . .

Let $A = \{2, 3, 4, 5, \ldots, 30\}$ and $\simeq$ be an equivalence relation on $A \times A$,defined by $(a, b) \simeq (c, d)$ if and only if $ad = bc$. Then the number of ordered pairs $(c, d)$ which satisfy this equivalence relation with the ordered pair $(4, 3)$ 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