The function $f: \mathbf{N}-\{1\} \rightarrow \mathbf{N}$; defined by $f(\mathrm{n})=$ the highest prime factor of $\mathrm{n}$, is :

Let A = {0, 1, 2, 3, 4, 5, 6, 7}. Then the number of bijective functions f : A $\to$ A such that f(1) + f(2) = 3 $-$ f(3) is equal to

Let A = {2, 3, 4, 5, ....., 30} and '$\simeq$' be an equivalence relation on A $\times$ A, defined by (a, b) $\simeq$ (c, d), if and only…

Let $A=\{1,2,3,5,8,9\}$. Then the number of possible functions $f: A \rightarrow A$ such that $f(m \cdot n)=f(m) \cdot f(n)$ for every $m,…

Let A = {a, b, c} and B = {1, 2, 3, 4}. Then the number of elements in the set C = {f : A $\to$ B | 2 $\in$ f(A) and f is not one-one} is…

Let $S=\{1,2,3, \ldots, 10\}$. Suppose $M$ is the set of all the subsets of $S$, then the relation $\mathrm{R}=\{(\mathrm{A}, \mathrm{B}):…