Question

Let R be a reflexive relation on a finite set A having n-elements and there be m-ordered pairs in R. then
A.\(m \geq n\)
B.\(m \leq n\)
C.m=n
D.None of these

Answer 1

okay now see... a reflexive relation is one where each element of a set is related to itself too, nut not necessarily just itself. so if a set A ha elements (a,b,c,d), then the relation have will definitely constitute of (a,a) (b,b) (c,c) (d,d) atleast, but can contain others like any (a,k) or (b, l) as well.
so you can guess that the relation 'R' will contain more or same no. of elements than the finite set 'A'. hence. m>=n

so, A!!!!

Answer 2

m > n
A = {1,2,3}
Reflexive Relation {(1,1),(1,2),(2,2),(2,1),(1,3)(3,1),(3,3)}

Answer 3

Are these AIEEE questions?

Answer 4

Can't be JEE, IMPOSSSSSSIBRRRRUU

Answer 5

Got it Thanks for that :D
NOOO NOT JEE!!!