Question

Let $R$ be a reflexive relation in a finite set having $n$ elements and let there be $m$ ordered pairs in $R$. Then,

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

Answer 1

Answer: (A)

$m\ge n$

$\underset{\left(nvaluespossible\right)}{\underset{\downarrow }{aRa}}$ $\underset{nelements}{\underset{\downarrow }{a\in A}}$

Given m ordered pairs. [We know n values possible that is at least n values cut of m]

$\therefore m\ge n$.