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

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

Loading...

Similar Threads for Primitive roots annoying | 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 root modulo n | Jan 9, 2009 |

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

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