Is there an easy (by which I mean an algorithm polynomial in size of input) way to know whether in the multiplicative group of integers mod P (P is a prime), whether an element is a generator or not?(adsbygoogle = window.adsbygoogle || []).push({});

**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!

# Primitive root modulo n

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