Given that for any $n \in \mathbf{N}$ there exist an odd integer $q$ and a non-negative integer $r$ such that, $n$ can be written uniquely as $n=q \times 2^r$.

Let $f: \mathbf{N} \rightarrow \mathbf{N} \times \mathbf{N}$ be function defined by $f(n)=\left(r+1, \frac{q+1}{2}\right)$. Then,

2. If $f: \mathbf{R} \rightarrow \mathbf{R}$ be defined by $f(x)=x+2|x+1|+2|x-1|$, then the element in the co-domain, which has unique pre image in the domain is

Let $H(x)=3 x^4+6 x^3-2 x^2+1$ and $g(x)$ be a polynomial of degree one. If

$\frac{H(x)}{(x-1)(x+1)(x-2)}=f(x)+\frac{g(x)}{(x-1)(x+1)(x-2)}$ then

$H(-1)+2 H(2)-3 H(1)=$

The number of bijective functions $f: \mathbf{Z} \rightarrow \mathbf{Z}$ such that $f(x+y)=f(x)+f(y) \forall x, y \in \mathbf{Z}$, is