Question 5. Let p= 3 (mod 4) be a prime. Assume that a is an integer such that the order of a is (p-1)/2, i.e., a(p-¹)/2 = 1 (mod p) but a" # 1 (mod p) for any n with 1 ≤ n < (p-1)/2. Prove that – a is a primitive root modulo p.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

[Number Theory] How do you solve this question? Short and typed answered preferred. Thanks!

Question 5. Let p = 3 (mod 4) be a prime. Assume that a is an integer such that the order of a is (p-1)/2,
i.e., a(p-¹)/2 = 1 (mod p) but aª ‡ 1 (mod p) for any n with 1 ≤ n < (p−1)/2. Prove that –a is a primitive
root modulo p.
Transcribed Image Text:Question 5. Let p = 3 (mod 4) be a prime. Assume that a is an integer such that the order of a is (p-1)/2, i.e., a(p-¹)/2 = 1 (mod p) but aª ‡ 1 (mod p) for any n with 1 ≤ n < (p−1)/2. Prove that –a is a primitive root modulo p.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,