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\ge n$
• B. $m\le n$
• C. $m=n$
• D. $m<n$

Answer 1

The correct option is A $m\ge n$

By the definition for a relation with $n$ elements to be reflexive relation it must have at least $n$ ordered pairs.
it has $m$ ordered pairs therefore $m\ge n$.