Let R be a reflexive relation on a finite set A having n -elements, and let there be m ordered pairs

English

Gujarati

Hindi

1.Relation and Function

normal

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

A

$m \ge n$

B

$m \le n$

C

$m = n$

D

None of these

Solution

(a) 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$.

Standard 12

Mathematics

Share

Similar Questions

Solution set of $x \equiv 3$ (mod $7$), $p \in Z,$ is given by

normal

Let $S$ be set of all real numbers ; then on set $S$ relation $R$ defined as $R = \{\ (a, b) : 1 + ab > 0\ \}$ is

normal

The relation "less than" in the set of natural numbers is

easy

Consider set $A = \{1,2,3\}$ . Number of symmetric relations that can be defined on $A$ containing the ordered pair $(1,2)$ & $(2,1)$ is

normal

An integer $m$ is said to be related to another integer $n$ if $m$ is a multiple of $n$. Then the relation is

easy