a) Find a mod p primitive root for p = 19, with the help of this primitive %3D root, make the indèx table.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.5: Congruence Of Integers
Problem 30E: 30. Prove that any positive integer is congruent to its units digit modulo .
icon
Related questions
Question

Correct and detailed answer will be Upvoted

a) Find a mod p primitive root for p = 19, with the help of this primitive
root, make the indèx table.
b) Show that if a,b is EN and ab =1 (p), where p is a prime number ( p
>2), ordpa = ordpbol.
Transcribed Image Text:a) Find a mod p primitive root for p = 19, with the help of this primitive root, make the indèx table. b) Show that if a,b is EN and ab =1 (p), where p is a prime number ( p >2), ordpa = ordpbol.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer