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:

  • A
    Reflexive
  • B
    Symmetric
  • C
    Transitive
  • D
    None of these

Explore More

Similar Questions

Consider the relations $R_1$ and $R_2$ defined as $a R_1 b \Leftrightarrow a^2+b^2=1$ for all $a, b \in R$ and $(a, b) R_2 (c, d) \Leftrightarrow a+d=b+c$ for all $(a, b), (c, d) \in N \times N$. Then:

Let $S = \{1, 2, 3, \ldots, 10\}$. Suppose $M$ is the set of all subsets of $S$. Then the relation $R = \{(A, B) : A \cap B \neq \phi; A, B \in M\}$ is :

Let $R$ be a relation from $N$ to $N$ defined by $R = \{(a, b) : a, b \in N \text{ and } a = b^2\}$. Is the following statement true?
$(a, a) \in R$,for all $a \in N$

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

The relation $R$ defined on the set of natural numbers as $\{(a, b) : a\}$ differs from $b$ by $3\}$ is given by

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