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

  • A
    Reflexive
  • B
    Symmetric
  • C
    Transitive
  • D
    Both $A$ and $B$

Explore More

Similar Questions

Let $A = \{1, 2, 3, \ldots, 20\}$. Let $R_1$ and $R_2$ be two relations on $A$ such that $R_1 = \{(a, b) : b \text{ is divisible by } a\}$ and $R_2 = \{(a, b) : a \text{ is an integral multiple of } b\}$. Then,the number of elements in $R_1 - R_2$ is equal to . . . . . . .

Show that the relation $R$ defined in the set $A$ of all polygons as $R = \{(P_{1}, P_{2}) : P_{1} \text{ and } P_{2} \text{ have the same number of sides}\}$,is an equivalence relation. What is the set of all elements in $A$ related to the right-angled triangle $T$ with sides $3, 4, \text{ and } 5$?

Let $R$ be a relation defined on the set $\{1,2,3,4\} \times \{1,2,3,4\}$ by $R = \{((a,b), (c,d)) : 2a + 3b = 3c + 4d\}$. Then the number of elements in $R$ is:

Let $R$ be a relation from $Q$ to $Q$ defined by $R = \{(a, b) : a, b \in Q \text{ and } a - b \in Z\}$. Show that $(a, b) \in R$ implies that $(b, a) \in R$.

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:

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