The number of bijective functions f : {1, 3, | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) The domain set $A = \{1, 3, 5, \ldots, 99\}$ contains $50$ elements. The codomain set $B = \{2, 4, 6, \ldots, 100\}$ also contains $50$ elements.S

Vedclass · Accepted Answer

$^{50}P_{33}$

Vedclass · Answer

(B) The domain set $A = \{1, 3, 5, \ldots, 99\}$ contains $50$ elements. The codomain set $B = \{2, 4, 6, \ldots, 100\}$ also contains $50$ elements.Since $f$ is a bijective function,it must be a permutation of the $50$ elements.The condition given is $f(3) \geq f(9) \geq f(15) \geq \ldots \geq f(99)$.Since $f$ is bijective,all values must be distinct,so the condition becomes $f(3) > f(9) > f(15) > \ldots > f(99)$.There are $17$ elements in the sequence $3, 9, 15, \ldots, 99$ (since $99 = 3 + (n-1)6 \implies n = 17$).We need to choose $17$ distinct values from the $50$ available values in the codomain for these $17$ inputs,which can be done in $^{50}C_{17}$ ways.Once chosen,there is only $1$ way to arrange these $17$ values in descending order to satisfy the condition.The remaining $50 - 17 = 33$ elements in the domain can be mapped to the remaining $33$ elements in the codomain in $33!$ ways.Thus,the total number of such functions is $^{50}C_{17} 	imes 33! = \frac{50!}{17! 	imes 33!} 	imes 33! = \frac{50!}{17!} = ^{50}P_{33}$.

The number of bijective functions $f : \{1, 3, 5, 7, \ldots, 99\} \rightarrow \{2, 4, 6, 8, \ldots, 100\}$ such that $f(3) \geq f(9) \geq f(15) \geq f(21) \geq \ldots \geq f(99)$ is:

Similar Questions

Given that $f: S \rightarrow R$ is said to have a fixed point at $c \in S$ if $f(c)=c$. Let $f:[1, \infty) \rightarrow R$ be defined by $f(x)=1+\sqrt{x}$. Then:

If $f: Z \rightarrow Z$ is defined by $f(x)=\begin{cases} \frac{x}{2}, & \text{if } x \text{ is even} \\ 0, & \text{if } x \text{ is odd} \end{cases}$,then $f$ is

Statement-$I$: Let $f : R \rightarrow R$ be a function such that $f(x) = x^3 + x^2 + 3x + \sin x$. Then $f$ is a one-one function.
Statement-$II$: $f(x)$ is a decreasing function.

Define $f: R \rightarrow R$ by $f(x) = \max \{x+1, 1-x, 2\}$. Then,$f$ is

If $f: N \rightarrow Z$ is defined by $f(n)=\begin{cases} 2 & \text{if } n=3k, k \in Z \\ 10 & \text{if } n=3k+1, k \in Z \\ 0 & \text{if } n=3k+2, k \in Z \end{cases}$, then $\{n \in N: f(n)>2\}$ is equal to

Vedclass Test Series

Exam Paper Generator

Online Exam Module