Let $E = \{ 1, 2, 3, 4 \} $ and $F = \{ 1, 2 \} $. Then the number of onto functions from $E$ to $F$ is

Let $A = \{x : x \in R, x \text{ is not a positive integer}\}$. Define $f: A \rightarrow R$ as $f(x) = \frac{2x}{x-1}$. Then $f$ is:

Let $A \subseteq R, B \subseteq R$ and $f: A \rightarrow B$ be defined by $f(x)=x^2-3x+2$. If $f$ is a bijection,then

Let $f: \mathbb{Z} \rightarrow \mathbb{Z}$ be defined by $f(x) = x^3 + 2$. Then,$f$ is . . . . . . .

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}$ for all $n \in N$. State whether the function $f$ is bijective. Justify your answer.

$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: