The number of strictly increasing functions $f$ from the set $A = \{1, 2, 3, 4, 5, 6\}$ to the set $B = \{1, 2, 3, \dots, 9\}$ such that $f(i) \neq i$ for all $1 \le i \le 6$ is equal to:

Let $f: R \rightarrow R$ be a function defined by $f(x) = \begin{cases} x^2 - 4x + 3, & \text{if } x < 2 \\ x - 3, & \text{if } x \geq 2 \end{cases}$. Then the number of real numbers $x$ for which $f(x) = 8$ is:

Let $A = \{1, 2, 3, 4, 5, 6\}$. The number of one-one functions $f: A \to A$ such that $f(1) \ge 3, f(3) \le 4$ and $f(2) + f(3) = 5$, is ————

The set $A$ has $4$ elements and the set $B$ has $5$ elements. Then,the number of injective mappings that can be defined from $A$ to $B$ 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

If $f:[0, \infty) \rightarrow[0, \infty)$ is defined by $f(x)=\frac{x}{1+x}$, then $f$ is