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
Get step-by-step solutions from verified subject matter experts
