bigp0ppa1046
New member
- Joined
- Jan 30, 2007
- Messages
- 18
Suppose that q is a prime number that is congruent to 1 modulo 4, and suppose that the number p=2q+1 is also a prime number. (For example, q could be 5 and p equal 11).
Show that 2 is a primitive root modulo p.
i computed some p values under these circumstances and i have a list:
p= 11, 19, 27, 35, 43, 51, etc
all of these numbers are 3 mod 4 but i dont think that helps???
can anyone help show that 2 is a primitive root of all mod p for this problem??
Show that 2 is a primitive root modulo p.
i computed some p values under these circumstances and i have a list:
p= 11, 19, 27, 35, 43, 51, etc
all of these numbers are 3 mod 4 but i dont think that helps???
can anyone help show that 2 is a primitive root of all mod p for this problem??