The number of one-one functions $f : \{a, b, c, d\} \rightarrow \{0, 1, 2, \dots, 10\}$ such that $2f(a) - f(b) + 3f(c) + f(d) = 0$ is

  • A
    $32$
  • B
    $31$
  • C
    $22$
  • D
    $89$

Explore More

Similar Questions

Given that for any $n \in N$, there exist an odd integer $q$ and a non-negative integer $r$ such that $n$ can be written uniquely as $n = q \times 2^r$. Let $f: N \rightarrow N \times N$ be a function defined by $f(n) = \left(r+1, \frac{q+1}{2}\right)$. Then,

Which of the following statements is true?

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

Which one of the following functions is a bijection?

The number of functions $f: \{1, 2, \ldots, 100\} \rightarrow \{0, 1\}$ that assign $1$ to exactly one of the positive integers less than or equal to $98$ is equal to $\qquad$.

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