Past exam of the mathematics course of the University of Cambridge 2010 ia Paper 3 6D Solution Created 2026-09-24 Updated 2026-10-14
The finite-group Lagrange theorem states that divides for every subgroup , since the disjoint left cosets all have size . In particular, the order of an element divides the group order.
If and , the cyclic subgroup has order greater than one and dividing , so it has order . Therefore every group of prime order is cyclic.
Let now be abelian of order . If an element has order , it generates , giving . Otherwise every nonidentity element has order . Choose and , which is possible because . Commutativity makesa group homomorphism. If and , choose with . Then , a contradiction. Hence and then . The homomorphism is injective and both groups have order , so it is an isomorphism. This proves the abelian group of prime-square order classification:Here denotes the dihedral group of order twelve, as specified in the paper: the hexagon's rotation through has order six. The possible cycle types in are the identity, three-cycles and double transpositions, of orders one, three and two. It has no element of order six. A group isomorphism preserves element orders, so