This next assignment deals with primitive roots.
Your task will be to implement a function, primitiveroots,
that takes in a small prime number and outputs a list of all the primitive roots of that number.
In the ide, in addition to primitive roots, we have provided a modular exponentiation function
similar to what was used in lecture and two simple test cases to use.
