galois.
carmichael
Implements the Carmichael function to find the smallest positive integer m such that a^m = 1 (mod n) for 1 <= a < n.
n (int) – A positive integer.
The smallest positive integer m such that a^m = 1 (mod n) for 1 <= a < n.
int