Primitive roots and there negatives

[talolard]

Homework Statement

if p is a prime of the form p=4k+1 and g is a primitive root of p, show that -g is a primitive root.


I'm not sure if this is a decent proof or not. My final argument looks suspicious. Any thoughts?
Thanks
Tal

The Attempt at a Solution

First, notive that [tex] \phi(p)=4k [/tex]. we wish to show that [tex]ord_{p}(-g)=4k[/tex].

Assume that [tex] \left(-g\right)^{d}\equiv1(p)[/tex] and [tex] d\neq4k[/tex] then d divides 4k.

Assume that d=2a then [tex] \left(-g\right)^{2a}=1\cdot g^{2a}[/tex] implies that[tex] ord_{p}(g)=2a[/tex] a contradiction. Thus d must be odd.

Assume that d is an odd factor of k. then [tex]\left(-1g\right)^{d}=-g^{d}\equiv1(p)\iff g^{d}\equiv-1\iff g^{2d}=1 thus ord_{p}(g)=2d [/tex]a contradiction.

Thus [tex]ord_{p}(-g)=4k[/tex] and -g is a primitive root.

Homework Statement

 

[micromass]

Hi talolard!

That looks like a decent proof to me! You may want to explain why [itex]ord_p(g)=2d[/itex] is a contradiction.

 

[talolard]

Great!
Thanks