If G is a finite group of anyone of the multiplicative non-zero elements of Q,R,C,or $Z_p$ then G is cyclic I have this theorem in my abstract algebra book that the book doesn't prove so I was wondering what is the best way to prove this theorem I proved it by the fact that if we consider c an element of G of largest order then we must have a element of G that divides it, but however I don't like this proof since it relies on some polynomial being solvable.
 A: Actually, the assertion is true for any field. It is based on the following result:
Lemma. If a finite group $G$ of order $n$ has at most $1$ subgroup of order $d$ for each divisor $d$ of $n$, then $G$ is cyclic.
Indeed, all elements of order $d$ of a finite subgroup of a field $K$ satisfy the equation $x^d-1=0$. As we're in a field, this equation has at most $d$ roots. Suppose there is an element $a$ of order $d$ in $K$. The equation $x^d = 1$ has $d$ roots, the elements of the subgroup generated by $a$: $\,\langle a\rangle=\{1,a, \dots, a^{d-1}\}$. 
If  there were another subgroup of order $d$, it would contain an element $b\notin\langle a\rangle$; its order would be a divisor of $d$ by Lagrange's theorem, so that $b$ would be  a $d+1$-th root of the equation $x^d=1$.
Proof of the lemma:
Let $\varphi$ be Euler's totient function. If $a$ is an element of order $d$ in $G$, there are $\varphi(d)$ elements of order $d$ in $\langle a\rangle$. Let $r(d$ be the number of cyclic subgroups of order $d$ ($r(d)=0$ or $1$ by hypothesis). The total number of elements order $d$ in $G$ is 
$r(d)\varphi(d)$, hence:
$$n=\lvert G\rvert=\sum_{d\mid n}r(d)\varphi(d)\le\sum_{d\mid n}\varphi(d)=n $$
so that $r(d)=1$ for all $d$; in particular $r(n)=1$, which proves $G$ is cyclic.
