Problem:
Compute the number of functions which satisfy for each .
Problem:
Compute the number of functions which satisfy for each .
Solution:
All cycle lengths in the permutation must divide , which is a prime number. Either for all , or there exists exactly one permutation cycle of length . In the latter case, there are ways to choose which numbers are in the cycle and ways to create the cycle. The answer is thus .