prim root

def primitive_root(prime):
    num_to_check = 0
    primitive_roots = []
    for each in range(1, prime):
        num_to_check += 1
        candidate_prim_roots = []
        for i in range(1, prime):
            modulus = (num_to_check ** i) % prime
            candidate_prim_roots.append(modulus)
            cleanedup_candidate_prim_roots = set(candidate_prim_roots)
            if len(cleanedup_candidate_prim_roots) == len(range(1, prime)):
                primitive_roots.append(num_to_check)
    return primitive_roots