Question: Find a primitive root modulo 31. That is, nd an integer n such that the powers 73, n2, n3, . . . , n30 give

 Find a primitive root modulo 31. That is, nd an integern such that the powers 73, n2, n3, . . . ,
n30 give different remainders (or residues) when divided by 31. (We workedout in class a similar problem with 23 in place of 31.

Find a primitive root modulo 31. That is, nd an integer n such that the powers 73, n2, n3, . . . , n30 give different remainders (or residues) when divided by 31. (We worked out in class a similar problem with 23 in place of 31. This is a bit of busy work but it should help you to absorb the concept. Note for instance that 2 is not a primitive root because 25 = 32 = 31 + 1, so you only get 5 different remainders, namely 2,4, 8, 16, 1.)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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 Mathematics Questions!