Question: Show that 2 is a primitive root modulo 13 and draw up a table of indices to this base. Hence, or otherwise, find all solutions

Show that 2 is a primitive root modulo 13 and draw up a table of indices to this base. Hence, or otherwise, find all solutions to the following congruences.

(i) x 16 3 (mod 13),

(ii) x 21 3 (mod 13),

(iii) x 31 7 (mod 13).

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!