MathDB
2021 Combo #4: Counting Functions

Source:

May 30, 2021
Combofunction

Problem Statement

Let S={1,2,,9}.S = \{1, 2, \dots, 9\}. Compute the number of functions f:SSf : S \rightarrow S such that, for all sS,f(f(f(s)))=ss \in S, f(f(f(s))) =s and f(s)sf(s) - s is not divisible by 33.