>
Mathematics
>
Relations and functions
>
let r be a reflexive relation on a finite set a ha
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
Updated On:
Jul 6, 2022
$m \ge n$
$m \le n$
$m = n$
None of these
Show Solution
Verified By Collegedunia
The Correct Option is
A
Solution and Explanation
Since R is reflexive relation on A, therefore
$(a,a) \in R$
for all
$a \in A$
. The minimum number of ordered pairs in R is n. Hence ,
$m \ge n$
Download Solution in PDF
Was this answer helpful?
0
0