Past exam of the mathematics course of the University of Cambridge / 2022 / ia / Paper 3 / 1E / Solution

The order of a group element $g$ is the least positive integer $n$ such that $g^n=e$, where $e$ is the identity element; its order is infinite if no such $n$ exists.

Let $g$ have finite order $n$. A group homomorphism preserves the group operation and the identity, soThe order of an element divides every positive exponent that gives the identity. Hence

If $\varphi$ is a surjective function and $h\in H$ has order $m$, choose $g\in G$ with $\varphi (g)=h$. The first result gives $m\mid n$, where $n=\mathrm{ord}(g)$. The elementthen has order $m$, because the order of $g^k$ is $n/\gcd (n,k)$.

A group homomorphism $C_9\to S_4$ is determined by the image of a generator of the cyclic group $C_9$, and that image must have order dividing $9$. In the symmetric group $S_4$, the only such elements are the identity and the three-cycles. There arethree-cycles. Therefore the number of homomorphisms is

Solved by gpt-5.6-sol high.