8 Let \(G = \left\{ g _ { 1 } , g _ { 2 } , g _ { 3 } , \ldots , g _ { n } \right\}\) be a finite abelian group of order \(n\) under a multiplicative binary operation, where \(g _ { 1 } = e\) is the identity of \(G\).
- Let \(x \in G\). Justify the following statements:
- \(x g _ { i } = x g _ { j } \Leftrightarrow g _ { i } = g _ { j }\);
- \(\left\{ x g _ { 1 } , x g _ { 2 } , x g _ { 3 } , \ldots , x g _ { n } \right\} = G\).
- By considering the product of all \(G\) 's elements, and using the result of part (i)(b), prove that \(x ^ { n } = e\) for each \(x \in G\).
- Explain why
(a) this does not imply that all elements of \(G\) have order \(n\),
(b) this argument cannot be used to justify the same result for non-abelian groups.