Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Exercise 1.3.3 (Orders of some permutations)
Exercise 1.3.3 (Orders of some permutations)
For each of the permutations whose cycle decompositions were computed in the preceding two exercises compute its order.
Answers
Proof. Consider the first example . Since the cycles are disjoints, for all ,
so . More generally, the order of a permutation is the l.c.m. of the lengths of the cycles in its cycle decomposition(see Ex.15). These gives the following results.
- Ex.1
- Ex.2