Sign in
12thPass logo
New chatPYQ LibraryDoubtsRank report
Sign in to see Recents

Your guest activity stays on this device

Sign in to save progress →
Sign in

Functions question

2023 · 30 Jan · Shift 1 · Q37
Guest · filters and generic practice availableBrowsing as a guest · PYQ filters and generic practice are available. Sign in only for personalised features and saved progress.
  1. PYQ Library
  2. /JEE Main
  3. /Mathematics
  4. /Functions
  5. /2023 · 30 Jan · Shift 1 · Q37

Functions question

2023 · 30 Jan · Shift 1 · Q37

JEE MainMathematicsFunctionsNumerical+4 / −1
Let S={1,2,3,4,5,6}S=\{1,2,3,4,5,6\}S={1,2,3,4,5,6}. Then the number of one-one functions f:S→P(S)f: \mathrm{S} \rightarrow \mathrm{P}(\mathrm{S})f:S→P(S), where P(S)\mathrm{P}(\mathrm{S})P(S) denote the power set of S\mathrm{S}S, such that f(n)⊂f( m)f(n) \subset f(\mathrm{~m})f(n)⊂f( m) where n<mn \lt mn<m is ‾\underline{\hspace{2cm}}​.
Numerical answer
View written solutionFree

Correct answer: 3240

  1. We need injective functions

f:S→P(S),S={1,2,3,4,5,6}f:S\to P(S),\qquad S=\{1,2,3,4,5,6\}f:S→P(S),S={1,2,3,4,5,6}

such that for all n<mn<mn<m,

f(n)⊂f(m).f(n)\subset f(m).f(n)⊂f(m).

So the images form a strictly increasing chain:

f(1)⊂f(2)⊂f(3)⊂f(4)⊂f(5)⊂f(6).f(1)\subset f(2)\subset f(3)\subset f(4)\subset f(5)\subset f(6).f(1)⊂f(2)⊂f(3)⊂f(4)⊂f(5)⊂f(6).

Since each inclusion is strict, injectivity is automatically satisfied.


  1. Rewrite the chain using successive differences.

Let

Ai=f(i),i=1,2,…,6.A_i=f(i),\qquad i=1,2,\dots,6.Ai​=f(i),i=1,2,…,6.

Then

A1⊂A2⊂A3⊂A4⊂A5⊂A6⊆S.A_1\subset A_2\subset A_3\subset A_4\subset A_5\subset A_6\subseteq S.A1​⊂A2​⊂A3​⊂A4​⊂A5​⊂A6​⊆S.

Define

\quad B_2=A_2\setminus A_1, \quad B_3=A_3\setminus A_2, \quad \dots, \quad B_6=A_6\setminus A_5, \quad B_7=S\setminus A_6.$$ Then: - $B_1,B_2,\dots,B_7$ are pairwise disjoint, - their union is $S$, - because each inclusion $A_i\subset A_{i+1}$ is strict, we must have $$B_2,B_3,B_4,B_5,B_6\neq \varnothing.$$ But $B_1$ and $B_7$ may be empty or nonempty. Thus counting such functions is equivalent to counting ways to distribute the 6 elements of $S$ into 7 labeled boxes $$B_1,B_2,B_3,B_4,B_5,B_6,B_7$$ with boxes $2,3,4,5,6$ nonempty. --- 3. Use inclusion-exclusion / surjection counting. First place each of the 6 elements into one of the 7 labeled boxes: total $$7^6.$$ We require 5 specific boxes ($B_2$ to $B_6$) to be nonempty. By inclusion-exclusion, the count is $$\sum_{j=0}^{5}(-1)^j\binom{5}{j}(7-j)^6.$$ Compute: $$\binom{5}{0}7^6=117649$$ $$\binom{5}{1}6^6=5\cdot 46656=233280$$ $$\binom{5}{2}5^6=10\cdot 15625=156250$$ $$\binom{5}{3}4^6=10\cdot 4096=40960$$ $$\binom{5}{4}3^6=5\cdot 729=3645$$ $$\binom{5}{5}2^6=64$$ So $$117649-233280+156250-40960+3645-64.$$ Now simplify: $$117649-233280=-115631$$ $$-115631+156250=40619$$ $$40619-40960=-341$$ $$-341+3645=3304$$ $$3304-64=3240.$$ Hence the number of such functions is $$\boxed{3240}.$$ --- 4. Comparison with stored answer Derived answer = $3240$. Stored correct answer = $3240$. They match.
PreviousNext

More from Functions

  • The range of the function f(x)=3−x​+2+x​ is :2023 · MCQ
  • Let A={1,2,3,5,8,9}. Then the number of possible functions f:A→A such that f(m⋅n)=f(m)⋅f(n) for every m,n∈A with m⋅n∈A is equal to ​.2023 · Numerical
  • If the domain of the function f(x)=1+x2[x]​, where [x] is greatest integer ≤x, is [2,6), then its range is2023 · MCQ
  • Let f:R−{2,6}→R be real valued function defined as f(x)=x2−8x+12x2+2x+1​. Then range of f is2023 · MCQ
  • The absolute minimum value, of the function f(x)=​x2−x+1​+[x2−x+1], where [t] denotes the greatest integer function, in the interval [−1,2], is :2023 · MCQ
  • The number of one-one functions f : {a, b, c, d} →{0, 1, 2, ......, 10} such that 2f(a) − f(b) + 3f(c) + f(d) = 0 is ​.2022 · Numerical
  • The total number of functions, f:{1,2,3,4}→{1,2,3,4,5,6} such that f(1)+f(2)=f(3), is equal to :2022 · MCQ
  • The number of bijective functions f:{1,3,5,7,…,99}→{2,4,6,8,….100}, such that f(3)≥f(9)≥f(15)≥f(21)≥…..f(99), is ​.2022 · MCQ