If $A = \{x \mid x \in N, x \leq 5\}$ and $B = \{x \mid x \in Z, x^{2} - 5x + 6 = 0\}$,then the number of onto functions from $A$ to $B$ is:

Show that the function $f: N \rightarrow N$,given by $f(1)=f(2)=1$ and $f(x)=x-1$ for every $x>2$,is onto but not one-one.

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 = \{x_1, x_2, x_3, \dots, x_7\}$ and $B = \{y_1, y_2, y_3\}$ be two sets containing seven and three distinct elements respectively. Then the total number of functions $f: A \to B$ which are onto,if there exist exactly three elements $x$ in $A$ such that $f(x) = y_2$,is equal to

The number of functions $f: \{1, 2, \ldots, 100\} \rightarrow \{0, 1\}$ that assign $1$ to exactly one of the positive integers less than or equal to $98$ is equal to $\qquad$.

$f:[-2,2] \rightarrow[-2,2]$ and $g:[-2,2] \rightarrow[0,4]$ are two functions defined as $f(x)=\begin{cases} -2, & -2 \leq x \leq 0 \\ x^2-2, & 0 \leq x \leq 2 \end{cases}$ and $g(x)=|f(x)|+f(|x|)$, then