Question

Let $R$ be a reflexive on a finite set $A$ 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$

The set consists of $n$ elements and for relation to be reflexive it must have at least $n$ ordered pairs. It has $m$ ordered pairs therefore $m\ge n$.