Let denote the set of all positive integers. Consider the sets
Let be the set of all functions such that and . Consider the set
Then the number of elements in the set is ___.
From the condition for all , we can see that if two different values of had the same , then would have to assign the same value to two different powers of 2. This is not possible because each is unique.
Therefore, must be a one-one (injective) function from to .
To find the total number of one-one functions from a set of 5 elements () to a set of 7 elements (), we first choose any 5 elements from 7 and then arrange them. Hence,
Now we subtract the functions that do not satisfy the given conditions: and .
Functions where : choose images for remaining 4 elements of from the remaining 6 elements of , and arrange them.
Similarly, functions where are also in number.
Functions where both and : we choose images for the remaining 3 elements from the remaining 5 elements of , and arrange them.
By the principle of inclusion and exclusion:
Tagged Composite functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.