# Tests whether val generates the multiplicative group of integers modulo mod. totient # must equal the Euler phi function of mod. In other words, the set of numbers # {valno % mod, val^1 % mod, ..., val"(totient-1) % mod) is equal to the set of all # numbers in the range fe, mod) that are coprime to mod. If mod is prime, then # totient = mod - 1, and powers of a generator produces all integers in the range [1, mod). # Return True or False. def is_generator(val, totient, mod): check_int(val) check_int(totient) check_int(mod) if not (0