Let and let denote the power set of . If the number of functions such that is , and and is least, then is equal to ______.
For each , must be a subset of that contains .
For each element , the number of subsets of containing is (the other 6 elements can each be in or out).
Since the choices for each element are independent, the total number of functions is .
We need with being the least natural number base. The smallest such is , giving .
.
Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.