Question

Let R be a reflexive relation on a finite set A having

n-elements, and let there be m ordered pairs in R. Then

• A. $m \geq n$
• B. $m \leq n$
• C. $m = n$
• D. None of these

Answer 1

Answer: (A)

$m \geq n$

Answer 2

Since R is reflexive relation on A, therefore $a \in A$.

The minimum number of ordered pairs in R is n.

Hence, $m \geq n$.