Let $A=\{1,2,3,4\}$ and $R$ be a relation on the set $A \times A$ defined by $R=\{((a, b),(c, d)): 2 a+3 b=4 c+5 d\}$. Then the number of elements in $R$ is:
$6$
$5$
$4$
$3$
Give an example of a relation. Which is Reflexive and transitive but not symmetric.
Let $A = \{1, 2, 3, 4\}$ and let $R= \{(2, 2), (3, 3), (4, 4), (1, 2)\}$ be a relation on $A$. Then $R$ is
In order that a relation $R$ defined on a non-empty set $A$ is an equivalence relation, it is sufficient, if $R$
Let $R$ be the relation in the set $\{1,2,3,4\}$ given by $R =\{(1,2),\,(2,2),\,(1,1),\,(4,4)$ $(1,3),\,(3,3),\,(3,2)\}$. Choose the correct answer.
Let $N$ be the set of natural numbers greater than $100. $ Define the relation $R$ by : $R = \{(x,y) \in \,N × N :$ the numbers $x$ and $y$ have atleast two common divisors$\}.$ Then $R$ is-