Question

Let R be an equivalence relation on a finite set A having n elements. Then the number of ordered pairs in R is

• A. Less than n
• B. Greater than or equal to n
• C. Less than or equal to n
• D. None of these

Answer 1

The correct option is B

Greater than or equal to n

Since R is an equivalence relation on set A,
Therefore(a,a) $\in$ R for all $a\in A$. Hence, R has at least n ordered pairs.