Let R be an equivalence relation on a finite set A having n elements. Then the number of ordered pairs in R is
Less than n
Greater than or equal to n
Less than or equal to n
None of these
Since R is an equivalnece relation on set, therefore a, a∈R for all a∈A. Hence, R has at least n ordered pairs.