>
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
Hide 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
Top Questions on Relations and functions
Let A = \{1, 2, 3\}. Then, the number of relations containing (1, 2) and (1, 3), which are reflexive and symmetric but not transitive, is
CUET (UG) - 2025
Mathematics
Relations and functions
View Solution
Let f: R $\rightarrow$ R be defined as f(x) = 10x. Then (Where R is the set of real numbers)
CUET (UG) - 2025
Mathematics
Relations and functions
View Solution
Let f: R $\rightarrow$ R be defined as f(x) = 10x. Then (Where R is the set of real numbers)
CUET (UG) - 2025
Mathematics
Relations and functions
View Solution
Let A = \{1, 2, 3\}. Then, the number of relations containing (1, 2) and (1, 3), which are reflexive and symmetric but not transitive, is
CUET (UG) - 2025
Mathematics
Relations and functions
View Solution
If the relation \( R \) is given by \[ R = \{(4, 5), (1, 4), (4, 6), (7, 6), (3, 7)\}, \] then find \( R^{-1} \circ R^{-1} \).
UP Board XII - 2025
Mathematics
Relations and functions
View Solution
View More Questions