Let . If is the smallest possible integer with , then .
Proof
Assume (trivial case) Then there exists some nonzero integer with . Assume without loss of generality.
Let be the smallest possible integer with By closure,
Let then for some By Division Algorithm 1, let with Then NB since , and by definition a subgroup must be closed under the operation, so . Furthermore, since , by closure, we have which by definition of implies . Therefore, so