# Show that $a^5$ is a primitive root mod $p$ implies a is a primitive root mod $p$

I was wondering how to show that $a^5$ is a primitive root mod $p$ implies that $a$ is a primitive root mod $p$. I've showed that $a^{(p-1)/2} \equiv -1 \pmod {p}$ using Legendre symbols, but I don't think this implies that $a$ is a primitive root.

If $a^5$ is a primitive root, then by definition all elements mod $p$ are powers of $a^5$, that is, are of the form $(a^5)^k=a^{5k}$. But then all elements are powers of $a$, and $a$ is a primitive root.

(This can only happen when $(p-1,5)=1$, but is not the point here.)

We have $\langle a^5\rangle\subseteq \langle a\rangle\subseteq(\mathbb Z/p\mathbb Z)^\times$. Hence $\langle a^5\rangle=(\mathbb Z/p\mathbb Z)^\times$ implies $\langle a^5\rangle= \langle a\rangle=(\mathbb Z/p\mathbb Z)^\times$.

If $a$ were not a primitive root, then there would exist some $n<p-1$ such that $a^n=1$. But then $a^{5n}=1$ and $a^5$ would not be a primitive root either.

• The contradiction is that $(a^5)^n=1$, but the order of $a^5$ should be greater than $n$. Commented Dec 1, 2014 at 18:11

OR

more generally, ord$_pa=d\implies$ ord $_p(a^k)=\dfrac d{(k,d)}$