Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
Check if 53 is a primitive root of Z151 by: (a) Theorem 6.8 Suppose that P element modulo Р (6) Euler's Criterion > 2 is a prime and a E Zp". Then a is a primitive (p-1)/a_ ² = 1 (mod p) for all primes a such that a I (p-1- of and only if a

Check if 53 is a primitive root of Z151 by: (a) Theorem 6.8 Suppose that P element modulo Р (6) Euler's Criterion > 2 is a prime and a E Zp". Then a is a primitive (p-1)/a_ ² = 1 (mod p) for all primes a such that a I (p-1- of and only if a

Advanced Engineering Mathematics
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
See similar textbooks
icon
Related questions
Question
Check if 53 is a primitive root of Z₁51 by: (a) Theorem 6.8 - Suppose that p > 2 is a prime and a E Zp". Then a is a primitive (p-1)/a element modulo ² = 1 (mod p) for all primes a such that a I (p-1). P of and only if a (6) Euler's Criterion
Transcribed Image Text:Check if 53 is a primitive root of Z₁51 by: (a) Theorem 6.8 - Suppose that p > 2 is a prime and a E Zp". Then a is a primitive (p-1)/a element modulo ² = 1 (mod p) for all primes a such that a I (p-1). P of and only if a (6) Euler's Criterion
THEOREM 6.9 (Euler's Criterion) Let p be an odd prime. Then a is a quadratic residue modulo p if and only if a(p-1)/2 = 1 (mod p). PROOF First, suppose a = y² (mod p). Recall from Corollary 6.6 that if p is prime, then ap−¹ = 1 (mod p) for any a #0 (mod p). Thus we have a(p-1)/2 = = = (y²)(p-1)/2 (mod p) yp-¹ (mod p) 1 (mod p). Conversely, suppose a(p-1)/2 = 1 (mod p). Let b be a primitive element modulo p. Then a = b¹ (mod p) for some positive integer i. Then we have a(p-1)/2 = (bi) (p-1)/2 (mod p) = fi(p-1)/2 (mod p). Since b has order p - 1, it must be the case that p - 1 divides i(p-1)/2. Hence, i is even, and then the square roots of a are ±b¹/2 mod p. I
Transcribed Image Text:THEOREM 6.9 (Euler's Criterion) Let p be an odd prime. Then a is a quadratic residue modulo p if and only if a(p-1)/2 = 1 (mod p). PROOF First, suppose a = y² (mod p). Recall from Corollary 6.6 that if p is prime, then ap−¹ = 1 (mod p) for any a #0 (mod p). Thus we have a(p-1)/2 = = = (y²)(p-1)/2 (mod p) yp-¹ (mod p) 1 (mod p). Conversely, suppose a(p-1)/2 = 1 (mod p). Let b be a primitive element modulo p. Then a = b¹ (mod p) for some positive integer i. Then we have a(p-1)/2 = (bi) (p-1)/2 (mod p) = fi(p-1)/2 (mod p). Since b has order p - 1, it must be the case that p - 1 divides i(p-1)/2. Hence, i is even, and then the square roots of a are ±b¹/2 mod p. I
Expert Solution
Step 1

Details attached in step 2 typesetted in latex.

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
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,
SEE MORE TEXTBOOKS