The number of relations $R$ from an $m$-element set $A$ to an $n$-element set $B$ satisfying the condition$\left(a, b_1\right) \in R,\left(a, b_2\right) \in R \Rightarrow b_1=b_2$ for $a \in A, b_1, b_2 \in B$ is

Show that the relation $R$ defined in the set $A$ of all polygons as $R=\left\{\left(P_{1}, P_{2}\right):\right.$ $P _{1}$ and $P _{2}$ have same number of sides $\}$, is an equivalence relation. What is the set of all elements in $A$ related to the right angle triangle $T$ with sides $3,\,4$ and $5 ?$

Given a non empty set $X$, consider $P ( X )$ which is the set of all subsets of $X$.

Define the relation $R$ in $P(X)$ as follows :

For subsets $A,\, B$ in $P(X),$ $ARB$ if and only if $A \subset B .$ Is $R$ an equivalence relation on $P ( X ) ?$ Justify your answer.

Let $A = \{p, q, r\}$. Which of the following is an equivalence relation on $A$

Determine whether each of the following relations are reflexive, symmetric and transitive :

Relation $\mathrm{R}$ in the set $\mathrm{A}=\{1,2,3, \ldots, 13,14\}$ defined as $\mathrm{R}=\{(x, y): 3 x-y=0\}$