Let $G$ be a group and $a$ an element of $G$ of order $n$.
Prove that: If $a^k = e$, then $n$ divides $k$
Here's a hint: Try writing $k=qn+r$ with $0\leq r<n$ by the division algorithm.
If $r\neq 0$, can you find a contradiction?
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
4 years ago
2 years ago
Get the weekly newsletter! In it, you'll get:
see an example newsletter