Groups of prime order are cyclic

A finite group of prime order is generated by any non-identity element
Groups of prime order are cyclic

Proposition (Prime order implies cyclic). Let GG be a finite with G=p|G|=p where pp is prime. Then GG is cyclic; more precisely, for every gGg\in G with geg\neq e, one has G=gG=\langle g\rangle.

Context. This is one of the first applications of : subgroup orders must divide the group order.

Proof sketch. Pick geg\neq e. The cyclic subgroup g\langle g\rangle is a subgroup of GG, hence its order divides G=p|G|=p. Since geg\neq e, g\langle g\rangle is nontrivial, so g1|\langle g\rangle|\neq 1, forcing g=p|\langle g\rangle|=p. Therefore g=G\langle g\rangle=G.