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 ————

  • A
    $100$
  • B
    $120$
  • C
    $140$
  • D
    $160$

Explore More

Similar Questions

The number of bijective functions $f: Z \rightarrow Z$ such that $f(x+y)=f(x)+f(y)$ for all $x, y \in Z$ is:

Let $X$ and $Y$ be subsets of $R$,the set of all real numbers. The function $f:X \to Y$ defined by $f(x) = x^2$ for $x \in X$ is one-one but not onto if (Here $R^+$ is the set of all positive real numbers):

Let $A=\{1,3,7,9,11\}$ and $B=\{2,4,5,7,8,10,12\}$. Then the total number of one-one maps $f: A \rightarrow B$,such that $f(1)+f(3)=14$,is:

$A$ function $f: R - \{ 0 \} \rightarrow R$ is defined as $f(x) = \begin{cases} x^2 + 3x - 7, & x > 0 \\ h(x), & x < 0 \end{cases}$ If $f(x)$ is an odd function, then $h(x) =$

Check the injectivity and surjectivity of the following function $f: N \rightarrow N$ defined by $f(x)=x^{2}$.

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo