15+ Primitive Root Calculator. $begingroup$ finding primitive roots is generally difficult. So you find the first primitive root by taking any number, calculating its powers until the result is 1, and if p = 13 you must have 12 different powers until the result is 1 to have a.

I know how to find primitive roots of prime numbers and small numbers as 14, where phi(14) = 6. Strictly speaking you wouldn’t need to check through the entire set as you know if $2$ isn’t a primitive root then $4$ isn’t one either and so on. Given 2 is a primitive root mod 19, find all solutions to x^12 ≡ 7 (mod 19) (a) x^12 ≡ 6 (mod 19) hot network questions how would you fix this bad circuit?








