1.32. Recall that g is called a primitive root modulo p if the powers of g give all nonzero elements of Fp. (a) For which of the following primes is 2 a primitive root modulo p? (i) p = 7 (ii) p = 13 (iii) p = 19 (iv) p = 23 (b) For which of the (i) p = 5 following primes is 3 a primitive root modulo p? (ii) p = 7 (iii) p = 11 (iv) p = 17

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

need help with all if possible.

1.32. Recall that g is called a primitive root modulo p if the powers of g give all
nonzero elements of Fp.
(a) For which of the following primes is 2 a primitive root modulo p?
(i) p = 7
(ii) p = 13
(iii) p = 19
(iv) p = 23
(b) For which of the following primes is 3 a primitive root modulo p?
(i) p = 5
(ii) p = 7
(iii) p = 11
(iv) p = 17
(c) Find a primitive root for each of the following primes.
(i) p = 23
(ii) p = 29
(iii) p = 41
(iv) p = 43
(d) Find all primitive roots modulo 11. Verify that there are exactly (10) of them,
as asserted in Remark 1.33.
(e) Write a computer program to check for primitive roots and use it to find all
primitive roots modulo 229. Verify that there are exactly (229) of them.
54
Exercises
(f) Use your program from (e) to find all primes less than 100 for which 2 is a
primitive root.
(g) Repeat the previous exercise to find all primes less than 100 for which 3 is a
primitive root. Ditto to find the primes for which 4 is a primitive root.
Transcribed Image Text:1.32. Recall that g is called a primitive root modulo p if the powers of g give all nonzero elements of Fp. (a) For which of the following primes is 2 a primitive root modulo p? (i) p = 7 (ii) p = 13 (iii) p = 19 (iv) p = 23 (b) For which of the following primes is 3 a primitive root modulo p? (i) p = 5 (ii) p = 7 (iii) p = 11 (iv) p = 17 (c) Find a primitive root for each of the following primes. (i) p = 23 (ii) p = 29 (iii) p = 41 (iv) p = 43 (d) Find all primitive roots modulo 11. Verify that there are exactly (10) of them, as asserted in Remark 1.33. (e) Write a computer program to check for primitive roots and use it to find all primitive roots modulo 229. Verify that there are exactly (229) of them. 54 Exercises (f) Use your program from (e) to find all primes less than 100 for which 2 is a primitive root. (g) Repeat the previous exercise to find all primes less than 100 for which 3 is a primitive root. Ditto to find the primes for which 4 is a primitive root.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 66 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,