Let R be a reflexive relation on a finite set A having n elements, and let there be m ordered paris in R, then

Question

Let R be a reflexive relation on a finite set A having n elements, and let there be m ordered paris in R, then (A)  m ge n  (B)  m le n  (C) m = n (D) m < n

Tardigrade Admin · Accepted Answer

The set consists of n elements and for relation to be reflexive it must have at least n ordered pairs, it has'm ordered pans therefore m ge n

Q. Let R be a reflexive relation on a finite set A having n elements, and let there be m ordered paris in R, then

$m \geq n$

$m \leq n$

m = n

m < n

The set consists of n elements and for relation to be reflexive it must have at least n ordered pairs, it has'm ordered pans therefore $m \geq n$