Exercise 2.8.3 (How many primitive roots modulo 13?)

Question

How many primitive roots does the prime $13$ have?

Richard Ganaye · Accepted Answer

\begin{proof} Since $\phi(12) = 4$, there are 4 primitive roots modulo $13$ (theorem 2.36).
\end{proof}
Check: 
\begin{verbatim}
sage:  p = 13; [a for a in GF(p) if a != 0 and a.multiplicative_order() == p-1]
[2, 6, 7, 11]
\end{verbatim}

Exercise 2.8.3 (How many primitive roots modulo 13?)

Answers

Comments

Exercise 2.8.3 (How many primitive roots modulo 13?)

Answers

Comments

Add answer