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

  • A
    $500$
  • B
    $620$
  • C
    $720$
  • D
    $885$

Explore More

Similar Questions

The real-valued function $f: R \rightarrow [ \frac{5}{2}, \infty )$ defined by $f(x) = | 2x + 1 | + | x - 2 |$ is

The number of onto functions $f$ from $\{1, 2, 3, \dots, 20\}$ to $\{1, 2, 3, \dots, 20\}$ such that $f(k)$ is a multiple of $3$ whenever $k$ is a multiple of $4$ is:

$f: N \rightarrow N$,is defined by $f(x)=x^6$ then, . . . . . . .

Let $A$ and $B$ be non-empty sets in $\mathbb{R}$ and $f : A \to B$ be a bijective function.
Statement $1$ : $f$ is an onto function.
Statement $2$ : There exists a function $g : B \to A$ such that $f \circ g = I_B$.

The functions which map $[-1, 1]$ to $[0, 2]$ are

Difficult
View Solution

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