If then . For the finite cases where then and for the infinite case then for all and for all .
Proof
Let . The elements are distinct since if with then , contradicting that be the smallest positive power of giving the identity. Thus has at least elements.
To show this is all of them, let be any power of . Using the Division Algorithm write where . Then:
Now for , no positive power of is the identity. If by assumption then (for clarity say ) we have . Thus we found a positive power that makes the identity, which is a contradiction.
Since distinct powers of are distinct elements of then .