Let $A = \{1, 2, 3, 4\}$ and $R$ be a relation in $A$ defined by $R = \{(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 1), (3, 1), (1, 3)\}$. Then $R$ is

  • A
    Reflexive
  • B
    Transitive
  • C
    An equivalence relation
  • D
    None of these

Explore More

Similar Questions

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 . . . . . . .

In $\mathbb{R}$,a relation $p$ is defined as follows: $\forall a, b \in \mathbb{R}$,$a \ p \ b$ holds if $a^2-4ab+3b^2=0$. Then:

Let $R$ be a relation from $A = \{2, 3, 4, 5\}$ to $B = \{3, 6, 7, 10\}$ defined by $R = \{(a, b) \mid a \text{ divides } b, a \in A, b \in B\}$. Then,the number of elements in $R^{-1}$ will be:

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

Let $L$ be the set of all straight lines in a plane and the relation $R$ on $L$ is defined by $\alpha R \beta \Leftrightarrow \alpha \perp \beta$,where $\alpha, \beta \in L$. 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