RankRizz
JEE MAIN 2021 · 27 JUL S1+4MEDIUMTRANSCRIBED

JEE Main 2021 Mathematics question — Functional equations

Let S={1,2,3,4,5,6,7}S = \{1, 2, 3, 4, 5, 6, 7\}. Then the number of possible functions f:S→Sf : S \rightarrow S such that f(m⋅n)=f(m)⋅f(n)f(m \cdot n) = f(m) \cdot f(n) for every m,n∈Sm, n \in S and m⋅n∈Sm \cdot n \in S, is equal to _________.

SOLUTION

We are given the set S={1,2,3,4,5,6,7}S=\{1,2,3,4,5,6,7\} and we must count all functions f:S→Sf:S\to S that satisfy the multiplicative rule

f(m⋅n)=f(m)⋅f(n)f(m\cdot n)=f(m)\cdot f(n)

for every pair m,n∈Sm,n\in S for which the product m⋅nm\cdot n is still inside SS. We begin by looking at the special element 11.

Taking m=1m=1 in the defining property gives the formula

f(1⋅n)=f(1)⋅f(n).f(1\cdot n)=f(1)\cdot f(n).

Because 1⋅n=n1\cdot n=n, this simplifies to

f(n)=f(1) f(n)for every n∈S.f(n)=f(1)\,f(n)\quad\text{for every }n\in S.

The only way this can hold for all nn (with the values always lying in SS and hence never being 00) is when

f(1)=1.f(1)=1.

So the value at 11 is completely fixed.

Next we list all products inside SS that are still in SS. Besides the trivial 1⋅n=n1\cdot n=n, only three distinct products appear:

2⋅2=4,2⋅3=6,3⋅2=6.2\cdot2=4,\qquad 2\cdot3=6,\qquad 3\cdot2=6.

No other product of two elements of SS stays within SS, because, for instance, 3⋅3=9∉S3\cdot3=9\notin S and 2⋅4=8∉S2\cdot4=8\notin S. Therefore the multiplicative rule imposes conditions only on the numbers 44 and 66. Let us introduce the convenient names

a=f(2),b=f(3).a=f(2),\qquad b=f(3).

Using the rule on each admissible product, we obtain:

1. For 2⋅2=42\cdot2=4 we must have

f(4)=f(2⋅2)=f(2)2=a2.f(4)=f(2\cdot2)=f(2)^2=a^2. 2. For 2⋅3=62\cdot3=6 (and equally for 3⋅2=63\cdot2=6) we must have

f(6)=f(2⋅3)=f(2) f(3)=ab.f(6)=f(2\cdot3)=f(2)\,f(3)=ab.

Thus the values of ff at 44 and 66 are forced once we pick a=f(2)a=f(2) and b=f(3)b=f(3). In contrast, the values at 55 and 77 are not tied to any product lying in SS, so they may be chosen freely from {1,2,3,4,5,6,7}\{1,2,3,4,5,6,7\} later on.

The crucial point is that every value of the function must lie in SS. Hence we need

a2≤7andab≤7.a^2\le 7\quad\text{and}\quad ab\le 7.

We now enumerate all possibilities for aa and bb satisfying these two inequalities.

• If a=1a=1, then a2=1≤7a^2=1\le7 automatically, and ab=b≤7ab=b\le7 for every b∈{1,2,3,4,5,6,7}b\in\{1,2,3,4,5,6,7\}. So with a=1a=1, we have 77 admissible choices for bb.

• If a=2a=2, then a2=4≤7a^2=4\le7 is still allowed, but the inequality ab≤7ab\le7 becomes 2b≤72b\le7, i.e. b≤3b\le3. Hence bb can be 1,2,1,2, or 33, giving 33 choices.

• If a≥3a\ge3, then a2≥9>7a^2\ge9>7, which violates a2≤7a^2\le7, so no further values of aa are possible.

Combining the two admissible cases, we have in total

7+3=107+3=10

legal pairs (a,b)=(f(2),f(3)).(a,b)=(f(2),f(3)).

After fixing such a pair, the values at 44 and 66 are already determined by f(4)=a2f(4)=a^2 and f(6)=abf(6)=ab, and they automatically lie in SS by the way we chose aa and bb. The final freedom rests with f(5)f(5) and f(7)f(7), each of which can be any of the 77 members of SS. Therefore the total number of distinct functions is

10  ×  7  ×  7  =  10  ×  49  =  490.10\;\times\;7\;\times\;7 \;=\;10\;\times\;49 \;=\;490.

So, the answer is 490490.

Tagged Functional equations. Machine-assigned, so read it as a strong shortlist rather than a verdict.

ChapterFunctions
TopicFunctional equations
TypeNumerical answer