Question: = Problem 3. Let n > 2 be an integer. Write the prime factorization (n) = 9...qt. Let g Z with gcd (g, n)

Problem 3. Let n > 2 be an integer. Write the prime factorization o(n) =qil... Let g e Z with ged(g, n) = 1. Prove that g is 

= Problem 3. Let n > 2 be an integer. Write the prime factorization (n) = 9...qt. Let g Z with gcd (g, n) = 1. Prove that g is a primitive root modulo n if and only if (n) gk #1 (mod n) for k = 1,..., t. Problem 4. Use the previous problem above to find the least primitive root modulo 191 by hand. Hint: I recommend using fast modular exponentiation to compute g95 mod 191 and so forth. You can do it!

Step by Step Solution

3.52 Rating (166 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

problem3 Suppose n2 pcm 9 gat D ged g n ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Accounting Questions!