Let’s fix a prime field for prime . Knowing a generator of , is a primitive -th root of unity in the field. But how to find a primitive root without a generator of ?

  1. For and relatively prime, the product of a primitive -th root of unity and a primitive -th root of unity is a primitive -th root of unity.

    Proof: First is a -th root of unity since . Suppose there exists for which . Then . Thus , but since and are coprime, . In the same manner . Thus as and don’t share any common factors. So is a primitive -th root of unity.

  2. For , is a primitive -th root of unity if and only if and for all , .

    Proof: If is a primitive -th root of unity then by definition and for all , so in particular for all , . For the other implication: we know that and for all , . In particular, is a -th root of unity, so its order divides by Lagrange. Since then for some prime factor of . Let’s call . Hence there exists such , and so . Contradiction! Thus is primitive -th root of unity, ie. has order .

  3. For a prime and the greatest such that , sample a primitive -th root of unity: sample , if then is a primitive -th root of unity in .

    Proof: We notice that and . Is for ? Assume there exists such that . Then , a contradiction.

For the prime decomposition , a primitive -th root of unity in is obtained by multiplying each primitive -th root of unity found through 3. thanks to 1.