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 - The Fusion of Science and Community**

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

# Primitive root modulo n

Loading...

Similar Threads - Primitive root modulo | Date |
---|---|

Primitive roots of Z_32 | Oct 28, 2012 |

Primitive roots & Reduced residue system | Mar 3, 2010 |

Relationship between primitive roots of a prime | Nov 17, 2009 |

Primitive 5th root of unity extension | Aug 18, 2008 |

Primitive roots - annoying problem | May 11, 2008 |

**Physics Forums - The Fusion of Science and Community**