- #1
RichardCypher
- 14
- 0
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![Frown :frown: :frown:](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
I've been told it's quite easy, but I can't see why it's true for the life of me