Prove that:(adsbygoogle = window.adsbygoogle || []).push({});

g is a generator of Fp* if and only if g^(p-1) = 1 (mod p) and gq ≠ 1 (mod p) for all prime divisors q of (p – 1).

I am thinking about applying Fermat's theorem...but don't know how...

Request help, thanks.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# About field

**Physics Forums | Science Articles, Homework Help, Discussion**