If $f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\}$ is a function such that $|f(\alpha) - \alpha| \leqslant 1$ for all $\alpha \in \{1, 2, 3, 4\}$,then the total number of such functions is:

Let $A$ and $B$ be sets. Show that $f: A \times B \rightarrow B \times A$ defined by $f(a, b) = (b, a)$ is a bijective function.

Let $f: N \rightarrow N$ be defined by $f(n) = \begin{cases} \frac{n+1}{2}; & \text{if } n \text{ is odd} \\ \frac{n}{2}; & \text{if } n \text{ is even} \end{cases}$. Then $f$ is:

Show that an onto function $f: \{1, 2, 3\} \rightarrow \{1, 2, 3\}$ is always one-one.

$f : R \to R$ is defined as $f(x) = \begin{cases} x^2 + 2mx - 1, & x \leq 0 \\ mx - 1, & x > 0 \end{cases}$. If $f(x)$ is one-one,then the set of values of $m$ is:

Let $f, g: N - \{1\} \rightarrow N$ be functions defined by $f(a) = \alpha$,where $\alpha$ is the maximum of the powers of those primes $p$ such that $p^{\alpha}$ divides $a$,and $g(a) = a + 1$,for all $a \in N - \{1\}$. Then,the function $f + g$ is.