Past exam of the mathematics course of the University of Oxford / 2014 / Prelims / Mathematics I / 5 / a / ii / Solution

The order of a group element $o(g)$ is the least positive integer $n$ for which $g^n=e$, whose existence follows from part (i). If $g^k=e$, use the Euclidean division to write $k=qn+r$, where $0\le r<n$. ThenMinimality of $n$ forces $r=0$. ThusThe argument also works for negative $k$, using integer powers and the same remainder convention.