Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Exercise 1.1.32 ($|x| \leq G$)
Exercise 1.1.32 ($|x| \leq G$)
If is an element of finite order in , prove that the elements are all distinct. Deduce that .
Answers
Proof. Assume for the sake of contradiction that there are integers such that
Then and . By definition of the order, , but , so . This is a contradiction, which proves that the elements are all distinct.
This shows that the set has elements, and , therefore
□