1
You visited us
1
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Standard X
Mathematics
Universal Set
Solve this: ...
Question
Solve this:
Q1. Let R be a reflexive relation of a finite set A having n elements and let there be m ordered pairs in R.
(A) m > n (B) m
≤
n (C) m = n (D) m
≥
n
Open in App
Solution
Dear student
Since
R
is
a
refelexive
relation
on
A
,
so
a
,
a
∈
R
for
all
a
∈
A
⇒
the
minimum
number
of
ordered
pairs
in
R
is
n
.
Here
m
≥
n
.
Regards
Suggest Corrections
0
Similar questions
Q.
Let
R
be a reflexive relation in a finite set having
n
elements and let there be
m
ordered pairs in
R
. Then,
Q.
Let
R
be a reflexive relation on a finite set
A
having
n
elements, and let there be
m
ordered pairs in
R
,
then:
Q.
Let
R
be a reflexive relation on finite set
A
having
n
−
elements, and let there be
m
−
ordered pairs in
R
.
Then
Q.
Let
R
be a reflexive on a finite set
A
having
n
elements, and let there be
m
ordered pairs in
R
. Then
Q.
Let
R
be an equivalance relation on a finite set
A
having
n
elements. Then, the number of ordered pairs in
R
is
View More
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
Related Videos
Universal Set
MATHEMATICS
Watch in App
Explore more
Universal Set
Standard X Mathematics
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
Solve
Textbooks
Question Papers
Install app