If $R$ is a relation from a set $A$ to a set $B$ and $S$ is a relation from $B$ to a set $C$, then the relation $SoR$

Let $R_1$ and $R_2$ be two relations on a set $A$ , then choose incorrect statement

The relation $R$ defined in $N$ as $aRb \Leftrightarrow b$ is divisible by $a$ is

Let $N$ denote the set of all natural numbers. Define two binary relations on $N$ as $R_1 = \{(x,y) \in  N \times  N : 2x + y= 10\}$ and $R_2 = \{(x,y) \in  N\times  N : x+ 2y= 10\} $. Then

Consider the relations $R_1$ and $R_2$ defined as $a R_1 b$ $\Leftrightarrow a^2+b^2=1$ for all $a, b, \in R$ and $(a, b) R_2(c, d)$ $\Leftrightarrow a+d=b+c$ for all $(a, b),(c, d) \in N \times N$. Then

Let $A=\{1,2,3\} .$ Then number of relations containing $(1,2)$ and $(1,3)$ which are reflexive and symmetric but not transitive is