Prove that the order of an element in is the least common multiple of the lengths of the cycles in its cycle decomposition.
Let have the form where the are pairwise disjoint and is an -cycle. Let , and let . Note that since the are disjoint, we have ; hence for each . By the definition of least common multiple, then, . Now we also have that , so that . Since and are both positive, .