Let $A = \{1, 2, 3, 4, 5, 6\}$. The number of functions $f: A \to A$ such that $f(m) + f(n) = 7$ whenever $m + n = 7$ is:

  • A
    $525$
  • B
    $216$
  • C
    $200$
  • D
    $729$

Explore More

Similar Questions

Show that the Signum Function $f: R \rightarrow R$,given by $f(x) = \begin{cases} 1, & \text{if } x > 0 \\ 0, & \text{if } x = 0 \\ -1, & \text{if } x < 0 \end{cases}$ is neither one-one nor onto.

Let $f(x) = \begin{cases} -a & \text{if } -a \leq x \leq 0 \\ x+a & \text{if } 0 < x \leq a \end{cases}$ where $a > 0$ and $g(x) = \frac{f(|x|) - |f(x)|}{2}$. Then the function $g: [-a, a] \rightarrow [-a, a]$ is

$f(x) = x + \sqrt{x^2}$ is a function from $R \to R$,then $f(x)$ is

For real $x,$ let $f(x) = x^3 + 5x + 1,$ then

Let $f: R \to R$ be defined as $f(x) = x^3$. Then $f$ is . . . . . . .

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