Show that, for n>1, 3 is a primitive root of any prime of the form .

Thoughts,

Need conditions such that if 3 is NOT a primitive root then such and such. But I don't know what the such and such should be.

Printable View

- May 9th 2010, 11:46 AMDeadstarPrimitive root of 2^n + 1
Show that, for n>1, 3 is a primitive root of any prime of the form .

Thoughts,

Need conditions such that if 3 is NOT a primitive root then such and such. But I don't know what the such and such should be. - May 9th 2010, 12:01 PMchiph588@
- May 9th 2010, 12:18 PMDeadstar
- May 9th 2010, 12:30 PMchiph588@
- May 9th 2010, 12:34 PMDeadstar