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 ≥ n

(B)  m ≤ n

(C)  m = n

(D)  None of these

Answer 1

Correct option  (A)  m ≥ n

Explanation :

Since R is reflexive relation on A, therefore (a,a)∈R for all a ∈ A . The minimum number of ordered pairs in R is n. Hence, m ≥ n.