# If $G$ be a cyclic group of prime order $p$, prove that every non-identity element of $G$ is a generator of $G$.

If $G$ be a cyclic group of prime order $p$, prove that every non-identity element of $G$ is a generator of $G$.

WE know that no of generator= $\phi{(p)}=p-1$.

We have, if $a$ is a generator of $G$ then $a^k$ is a generator iff $gcd(p,k)=1$. Here as $p$ is prime, then $k=1, 2,3,\cdots, p-1$ as gcd of each of $k$ with $p$ is $1$. Therefore, generator of $G$ are $a, a^2, a^3, \cdots a^{p-1}$. They are $p-1$ in number.

• Look at whether a power $a^i$ will be equal to $a^j$. If not, then all powers of distinct and <a> becomes a generator. – Shailesh Sep 25 '15 at 4:34
• @Shailesh How to show that " power $a^i$ will be equal to $a^j$ ..." – rama_ran Sep 25 '15 at 4:42
• Ok, First of all every group of prime order is cyclic. Let $a \ne e$ be an element of the group. Now consider all powers of $a$. If, for some $i,j$, $a^i = a^j$, then $a^{i-j} = e$, so the order of this element $a$ is $i-j \lt p$, but the order of an element divides the order of the group. Use this to show that all the powers of $a$ are distinct, which means any $a$ is a generator. Please fill in the gaps. – Shailesh Sep 25 '15 at 4:48

Hint: Recall that by Lagrange's thereom, $\vert g \vert$ divides $\vert G \vert$ $\forall$ $g$ $\in$ $G$.So what can you about $\vert g\vert$ ?
Edit: let $g \in G$,consider the subgroup $H=<g>$ and by Lagrange's theorem $\vert H \vert$ divides $\vert G \vert$,hence $\vert g \vert$ divides $\vert G \vert$.
• Lagrange's thereom tells that order of every subgroup of a finite group G is a divisor of $o(G)$. But If d divides $o(G)$ it is not necessarily true that there is a subgroup of $o(d)$. You are telling about order of element divides $o(G)$ but Lagrange's theorem tells $o(subgroup)$ divides $o(G)$. Also I am not understand how your argument proves the desired result? – rama_ran Sep 25 '15 at 4:39