modulo p if Let p be a prime number. We say that geZ is a primitive...

Transcribed Image Text:

modulo p if Let p be a prime number. We say that geZ is a primitive root {g % p | k = 1, 2,...,p-1} = {1, 2,...,p-1}. Write a function to decide if g is a primitive root. For now, don't worry about how efficient it is; the naive approach is fine. # Return True if g is a primitive root modulo p, and False otherwise def is_prim_root (g,p): [FILL IN CODE] Use your code to find all the primitive roots modulo 101. modulo p if Let p be a prime number. We say that geZ is a primitive root {g % p | k = 1, 2,...,p-1} = {1, 2,...,p-1}. Write a function to decide if g is a primitive root. For now, don't worry about how efficient it is; the naive approach is fine. # Return True if g is a primitive root modulo p, and False otherwise def is_prim_root (g,p): [FILL IN CODE] Use your code to find all the primitive roots modulo 101.