Let . Then the number of bijective functions such that is equal to ___.
We need bijective functions where satisfying , i.e., .
Since is a bijection (permutation of ), the values must be three distinct elements of that sum to 3.
We need to find all sets of three distinct non-negative integers from that sum to 3. The possible unordered sets are:
: sum . This works.
No other triple of distinct non-negative integers from sums to 3, since the next smallest sum of three distinct elements would be .
So . The three values can be assigned to in ways.
The remaining 5 inputs must map to the remaining 5 outputs , and these can be assigned in ways.
The total number of bijective functions is .
Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.