|
|
EXAMPLE
| Any period 3 permutation (or disjoint combinations) is one element to be counted. This starts with n=3, where there are only 2 cases:
f1:{1,2,3}->{2,3,1} and f2:{1,2,3}->{3,1,2}
but for n>3 there are other elements (non permutations) to be counted
(for instance, with n=5, we count with f:{1,2,3,4,5}->{2,4,5,3,4}).
|
