Primitive Root(Part I)

from wikipedia:

In modular arithmetic, a number g is a primitive root modulo n if every number a coprime to n is congruent to a power of g modulo n. That is, g is a primitive root modulo n, if for every integer a coprime to n, there is some integer k for which g^k ≡ a (mod n). Such a value k is called the index or discrete logarithm of a to the base g modulo n. Note that g is a primitive root modulo n if and only if g is a generator of the multiplicative group of integers modulo n.

The concept of promitive root is widely used in many algorithms to solve problems in number theory, including the famous Baby-Step Giant-Step algorithm.

Prerequisite Knowledge

orders of elements

$$\begin{gathered} forg\in \mathbb{Z}，m\in {\mathbb{N}}^{\ast }，if\gcd (g,m)=1，wedefinen, \\ \text{ the smallest positive interger that satisfies }{g}^n\equiv 1(\mathrm{m}\mathrm{o}\mathrm{d}m) \\ \text{to be the order of g modulo m}。 \end{gathered}$$
that is
o r d ( g ) = ϵ m ( g ) = m i n { n ∈ N : g n ≡ 1 ( m o d   m ) } ord(g) =\epsilon_m(g) = min\lbrace n ∈ N : g ^n ≡ 1 (mod\ m)\rbrace ord(g)=ϵm​(g)=min{ n∈N:gn≡1(mod m)}

Theorem 1.1

$g,g^2,\cdots ,g^{{ϵ}_m(g)}$ gives different remainder modulo $m$.

Proof by contradiction:

Suppose we have $i,j\in [1,{ϵ}_m(g)],i\ne j$ and $g^i\equiv g^j(modm)$, we would have