First slide

Relations XII

Question

Let R be a reflexive relation on a finite set A having elements, and let there be m ordered pairs in R. Then

Easy

A

$m \geq n$
B

$m \leq n$
C

$m = n$
D

None of these

Solution

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 \geq n .$

Get Instant Solutions

When in doubt download our app. Now available Google Play Store- Doubts App

Recieve an sms with download link

Doubts App

OR

SCAN ME

Doubts App

Doubts App