Let $R$ be a reflexive relation on a finite set $A$ containing $n$ elements,and let $R$ contain $m$ ordered pairs. Then,

  • A
    $m \ge n$
  • B
    $m \le n$
  • C
    $m = n$
  • D
    None of these

Explore More

Similar Questions

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

Let $R$ be a relation on a set $A$ such that $R = R^{-1}$. Then $R$ is:

Let $L$ denote the set of all straight lines in a plane. Let a relation $R$ be defined by $\alpha R\beta \Leftrightarrow \alpha \perp \beta$,where $\alpha, \beta \in L$. Then $R$ is

Let $X$ be a non-void set. If $\rho_1$ and $\rho_2$ are transitive relations on $X$, then which of the following is true?

Let $A$ be a non-empty set of children in a family. The relation $R$ is defined on $A$ as '$x$ is a brother of $y$'. This relation 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