Let $A = \{1, 2, 3, 4, 5\}$ and $B = \{1, 2, 3, 4, 5, 6\}$. Then the number of functions $f: A \rightarrow B$ satisfying $f(1) + f(2) = f(4) - 1$ is equal to

Let $S = \{1, 2, 3, 4, 5, 6, 7\}$. Then the number of possible functions $f: S \rightarrow S$ such that $f(m \cdot n) = f(m) \cdot f(n)$ for every $m, n \in S$ and $m \cdot n \in S$ is equal to $......$

Let $f, g: R \rightarrow R$ be defined,respectively,by $f(x) = x + 1$ and $g(x) = 2x - 3$. Find $f+g$,$f-g$,and $\frac{f}{g}$.

The number of solutions of the equation $|x^2 - 2|x|| = 2^x$ is:

If $f: R-\{0\} \rightarrow R$ is defined by $f(x)=x+\frac{1}{x}$ and if $f^k(x)=[f(x)]^k$ for $k \geq 1$,then find the value of $f^4(x)-f(x^4)-4f^2(x)$.

If a function $g(x)$ is defined in $[-1, 1]$ and two vertices of an equilateral triangle are $(0, 0)$ and $(x, g(x))$ and its area is $\frac{\sqrt{3}}{4}$,then $g(x)$ equals :-