Page 1 of 1
Suppose p is a prime of the form p=2"+1, n > 1. Prove that 3 is a primitive root (mod p). Suppose p is a prime of the fo
Posted: Wed May 04, 2022 10:17 am
by answerhappygod
- Suppose P Is A Prime Of The Form P 2 1 N 1 Prove That 3 Is A Primitive Root Mod P Suppose P Is A Prime Of The Fo 1 (15.19 KiB) Viewed 27 times
Suppose p is a prime of the form p=2"+1, n > 1. Prove that 3 is a primitive root (mod p). Suppose p is a prime of the form p = 4q+1 where q is a prime. Prove that 2 is a primitive root (mod p). Suppose p is a prime of the form p 2q + 1 where q is a prime, q = 3(mod 4). Prove that -2 is a primitive root (mod p).