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

The function $f:[0,3] \rightarrow [1,29]$,defined by $f(x)=2x^3-15x^2+36x+1$,is

If $f: R \rightarrow R$ is defined by $f(x)=x-[x]-\frac{1}{2}$ for $x \in R$, where $[x]$ is the greatest integer not exceeding $x$, then $\{x \in R: f(x)=\frac{1}{2}\}$ is equal to :

If $f: R \rightarrow C$ is defined by $f(x)=e^{2 i x}$ for $x \in R$,then $f$ is (where $C$ denotes the set of all complex numbers)

If $f(x) = \sin([\pi^2]x) - \sin([-\pi^2]x)$,where $[x]$ denotes the greatest integer function $\leq x$,then which of the following is not true?

If a set $A$ has $m$ elements and set $B$ has $n$ elements and the number of injections from $A$ to $B$ is $2520$. Then,$m$ is equal to

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