proof that divides
The following is a proof that, for every group that has an exponent and for every , divides .
Proof.
By the division algorithm, there exist with such that . Since , by definition of the order of an element, cannot be positive. Thus, . It follows that divides . ∎
Title | proof that divides |
---|---|
Canonical name | ProofThatgDividesoperatornameexpG |
Date of creation | 2013-03-22 13:30:35 |
Last modified on | 2013-03-22 13:30:35 |
Owner | Wkbj79 (1863) |
Last modified by | Wkbj79 (1863) |
Numerical id | 8 |
Author | Wkbj79 (1863) |
Entry type | Proof |
Classification | msc 20D99 |