Let . Then the number of possible functions such that for every and , is equal to _________.
We are given the set and we must count all functions that satisfy the multiplicative rule
for every pair for which the product is still inside . We begin by looking at the special element .
Taking in the defining property gives the formula
Because , this simplifies to
The only way this can hold for all (with the values always lying in and hence never being ) is when
So the value at is completely fixed.
Next we list all products inside that are still in . Besides the trivial , only three distinct products appear:
No other product of two elements of stays within , because, for instance, and . Therefore the multiplicative rule imposes conditions only on the numbers and . Let us introduce the convenient names
Using the rule on each admissible product, we obtain:
1. For we must have
2. For (and equally for ) we must have
Thus the values of at and are forced once we pick and . In contrast, the values at and are not tied to any product lying in , so they may be chosen freely from later on.
The crucial point is that every value of the function must lie in . Hence we need
We now enumerate all possibilities for and satisfying these two inequalities.
• If , then automatically, and for every . So with , we have admissible choices for .
• If , then is still allowed, but the inequality becomes , i.e. . Hence can be or , giving choices.
• If , then , which violates , so no further values of are possible.
Combining the two admissible cases, we have in total
legal pairs
After fixing such a pair, the values at and are already determined by and , and they automatically lie in by the way we chose and . The final freedom rests with and , each of which can be any of the members of . Therefore the total number of distinct functions is
So, the answer is .
Tagged Functional equations. Machine-assigned, so read it as a strong shortlist rather than a verdict.