Let [tex]r[/tex] be a primitive root of a prime number [tex]p \geq 3[/tex]. Prove that if [tex]p \equiv 1 (mod 4)[/tex], then [tex]-r[/tex] is also a primitive root of [tex]p[/tex].(adsbygoogle = window.adsbygoogle || []).push({});

I've been told it's quite easy, but I can't see why it's true for the life of me

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

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 roots - annoying problem

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