|
|
|
|
proof that divides
|
(Proof)
|
|
|
The following is a proof that $\operatorname{exp}~G$ divides $|G|$ for every finite group $G$
Proof. By the division algorithm, there exist $q,r \in {\mathbb Z}$ with $0 \le r<\operatorname{exp}~G$ such that $|G|=q(\operatorname{exp}~G)+r$ Let $g \in G$ Then $e_G=g^{|G|}=g^{q(\operatorname{exp}~G)+r}=g^{q(\operatorname{exp}~G)}g^r=(g^{\operatorname{exp}~G})^qg^r=(e_G)^qg^r=e_Gg^r=g^r$ Thus, for every $g \in G$ $g^r=e_G$ By the definition of exponent, $r$ cannot be positive. Thus, $r=0$ It follows that $\operatorname{exp}~G$ divides $|G|$ 
|
"proof that divides " is owned by Wkbj79.
|
|
(view preamble | get metadata)
Cross-references: positive, exponent, division algorithm, finite group, divides, proof
This is version 7 of proof that divides , born on 2003-03-11, modified 2007-05-30.
Object id is 4091, canonical name is ProofThatExpGDividesG.
Accessed 1947 times total.
Classification:
| AMS MSC: | 20D99 (Group theory and generalizations :: Abstract finite groups :: Miscellaneous) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|