Let $R$ be a reflexive relation on a finite set $A$ having $n$-elements, and let there be m ordered pairs in $R$. Then
$m \ge n$
$m \le n$
$m = n$
None of these
Let $R =\{( P , Q ) \mid P$ and $Q$ are at the same distance from the origin $\}$ be a relation, then the equivalence class of $(1,-1)$ is the set
Let $A =\{2,3,4,5, \ldots ., 30\}$ and $^{\prime} \simeq ^{\prime}$ be an equivalence relation on $A \times A ,$ defined by $(a, b) \simeq (c, d),$ if and only if $a d=b c .$ Then the number of ordered pairs which satisfy this equivalence relation with ordered pair $(4,3)$ is equal to :
Which one of the following relations on $R$ is an equivalence relation
Let $R\,= \{(x,y) : x,y \in N\, and\, x^2 -4xy +3y^2\, =0\}$, where $N$ is the set of all natural numbers. Then the relation $R$ is
Maximum number of equivalence relations on set $A = \{1, 2, 3, 4\}$ is $N$, then -