If any permutation p on a finite set [0,…,n−1] is repeated often enough, it reach be the identity permutation. The smallest m such that pm is the identity is called the order of p.
The permuorder command computes the order of a permutation.
Examples.
2 |
6 |