- #1

- 14

- 0

## Main Question or Discussion Point

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].

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

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