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 2 · Q36
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 2 · Q36

Functions question

2023 · 30 Jan · Shift 2 · Q36

JEE MainMathematicsFunctionsNumerical+4 / −1
Let A={1,2,3,5,8,9}A=\{1,2,3,5,8,9\}A={1,2,3,5,8,9}. Then the number of possible functions f:A→Af: A \rightarrow Af:A→A such that f(m⋅n)=f(m)⋅f(n)f(m \cdot n)=f(m) \cdot f(n)f(m⋅n)=f(m)⋅f(n) for every m,n∈Am, n \in Am,n∈A with m⋅n∈Am \cdot n \in Am⋅n∈A is equal to ‾\underline{\hspace{2cm}}​.
Numerical answer
View written solutionFree

Correct answer: 432

  1. We need to count functions f:A→Af:A\to Af:A→A, where A={1,2,3,5,8,9},A=\{1,2,3,5,8,9\},A={1,2,3,5,8,9}, such that f(mn)=f(m)f(n)f(mn)=f(m)f(n)f(mn)=f(m)f(n) for every m,n∈Am,n\in Am,n∈A with mn∈Amn\in Amn∈A.

So first, identify all products of elements of AAA that still lie in AAA.

  1. Check possible multiplicative relations inside AAA:
  • 1⋅a=a∈A1\cdot a=a\in A1⋅a=a∈A for every a∈Aa\in Aa∈A.
  • 2⋅2=4∉A2\cdot 2=4\notin A2⋅2=4∈/A.
  • 2⋅3=6∉A2\cdot 3=6\notin A2⋅3=6∈/A.
  • 2⋅5=10∉A2\cdot 5=10\notin A2⋅5=10∈/A.
  • 2⋅8=16∉A2\cdot 8=16\notin A2⋅8=16∈/A.
  • 2⋅9=18∉A2\cdot 9=18\notin A2⋅9=18∈/A.
  • 3⋅3=9∈A3\cdot 3=9\in A3⋅3=9∈A.
  • 5⋅5=25∉A5\cdot 5=25\notin A5⋅5=25∈/A.
  • 2⋅42\cdot 42⋅4 not relevant since 4∉A4\notin A4∈/A.
  • 2⋅2⋅2=82\cdot 2\cdot 2=82⋅2⋅2=8, but the condition is only for pairs; however 8=2⋅48=2\cdot 48=2⋅4 does not help because 4∉A4\notin A4∈/A.

Also, 8=2⋅4(4∉A),9=3⋅3.8=2\cdot 4 \quad (4\notin A), \qquad 9=3\cdot 3.8=2⋅4(4∈/A),9=3⋅3. So the only nontrivial pair relation is f(9)=f(3)2.f(9)=f(3)^2.f(9)=f(3)2.

From multiplication by 111, we also get constraints.

  1. Use the condition with m=1m=1m=1 and any n∈An\in An∈A: f(1⋅n)=f(1)f(n).f(1\cdot n)=f(1)f(n).f(1⋅n)=f(1)f(n). Since 1⋅n=n1\cdot n=n1⋅n=n, this gives f(n)=f(1)f(n)for all n∈A.f(n)=f(1)f(n) \quad \text{for all } n\in A.f(n)=f(1)f(n)for all n∈A. Because f(n)∈Af(n)\in Af(n)∈A and no element of AAA is 000, we can divide by f(n)f(n)f(n) to get f(1)=1.f(1)=1.f(1)=1. So f(1)f(1)f(1) is forced.

  2. Now use the only other nontrivial relation: f(9)=f(3)2.f(9)=f(3)^2.f(9)=f(3)2. Since f(9)∈Af(9)\in Af(9)∈A, we need f(3)2∈Af(3)^2\in Af(3)2∈A. Let us test possible values of f(3)∈Af(3)\in Af(3)∈A:

  • If f(3)=1f(3)=1f(3)=1, then f(9)=12=1∈Af(9)=1^2=1\in Af(9)=12=1∈A.
  • If f(3)=2f(3)=2f(3)=2, then f(9)=4∉Af(9)=4\notin Af(9)=4∈/A.
  • If f(3)=3f(3)=3f(3)=3, then f(9)=9∈Af(9)=9\in Af(9)=9∈A.
  • If f(3)=5f(3)=5f(3)=5, then f(9)=25∉Af(9)=25\notin Af(9)=25∈/A.
  • If f(3)=8f(3)=8f(3)=8, then f(9)=64∉Af(9)=64\notin Af(9)=64∈/A.
  • If f(3)=9f(3)=9f(3)=9, then f(9)=81∉Af(9)=81\notin Af(9)=81∈/A.

Hence only two possibilities: f(3)=1⇒f(9)=1,f(3)=1 \Rightarrow f(9)=1,f(3)=1⇒f(9)=1, f(3)=3⇒f(9)=9.f(3)=3 \Rightarrow f(9)=9.f(3)=3⇒f(9)=9. So there are exactly 222 choices for the pair (f(3),f(9))(f(3),f(9))(f(3),f(9)).

  1. What about f(2),f(5),f(8)f(2), f(5), f(8)f(2),f(5),f(8)? There are no multiplicative relations in AAA involving these elements that produce another element of AAA (except multiplication by 111, which only forced f(1)=1f(1)=1f(1)=1). So each of f(2),f(5),f(8)f(2), f(5), f(8)f(2),f(5),f(8) can be chosen freely from AAA.

Thus:

  • f(2)f(2)f(2): 666 choices
  • f(5)f(5)f(5): 666 choices
  • f(8)f(8)f(8): 666 choices
  • (f(3),f(9))(f(3),f(9))(f(3),f(9)): 222 choices
  • f(1)f(1)f(1): 111 forced choice

Total number of functions: 1⋅6⋅6⋅6⋅2=432.1\cdot 6\cdot 6\cdot 6\cdot 2=432.1⋅6⋅6⋅6⋅2=432.

  1. Therefore, the required number of functions is 432.\boxed{432}.432​.
PreviousNext

More from Functions

  • 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
  • Let f(x) be a quadratic polynomial with leading coefficient 1 such that f(0)=p,peq0, and f(1)=31​. If the equations f(x)=0 and f∘f∘f∘f(x)=0 have a common real root, then f(−3) is equal to ​…2022 · Numerical
  • Let f : N → R be a function such that f(x+y)=2f(x)f(y) for natural numbers x and y. If f(1) = 2, then the value of α for which k=1∑10​f(α+k)=3512​(220−1) holds, is :2022 · MCQ