- 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 28 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 fo
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
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
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).
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!