Show that the relation $R$ in the set $R$ of real numbers, defined as $R =\left\{(a, b): a \leq b^{2}\right\}$ is neither reflexive nor symmetric nor transitive.

The probability that a relation $R$ from $\{ x , y \}$ to $\{ x , y \}$ is both symmetric and transitive, is equal to

Maximum number of equivalence relations on set $A = \{1, 2, 3, 4\}$ is $N$, then –

Let $\mathrm{A}=\{1,2,3,4,5\}$. Let $\mathrm{R}$ be a relation on $\mathrm{A}$ defined by $x R y$ if and only if $4 x \leq 5 y$. Let $m$ be the number of elements in $\mathrm{R}$ and $\mathrm{n}$ be the minimum number of elements from $\mathrm{A} \times \mathrm{A}$ that are required to be added to $\mathrm{R}$ to make it a symmetric relation. Then $m+n$ is equal to:

Let $A =\{1,2,3,4, \ldots .10\}$ and $B =\{0,1,2,3,4\}$ The number of elements in the relation $R =\{( a , b )$ $\left.\in A \times A : 2( a – b )^2+3( a – b ) \in B \right\}$ is $………$.