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

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

Explore More

Similar Questions

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

Let $A = \{1, 2, 3\}$. The relation $R$ on set $A$ is defined as $R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)\}$. Determine the nature of the relation $R$.

Show that the relation $R$ in the set $A$ of all the books in a library of a college,given by $R = \{(x, y) : x \text{ and } y \text{ have the same number of pages} \}$ is an equivalence relation.

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

The number of relations on the set $\{1,2,3\}$ containing $(1,2)$ and $(2,3)$,which are reflexive and transitive but not symmetric,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