Here is my solution. It's a fairly straightforward brute force search.
First, I wrote a function that return if a number r is a primitive root.
A loop through all the possible exponents to see if the result has been seen before in our set s.
If it has, we return False. If no repeats were found, we return True.
Using isprimitiveroot, we then loop through all the possible options,
checking if it's a primitive root and appending it to our list.
When we've looped through all the possible options, we return our list.
