Modular Arithmetic
Compute a mod n, gcd(a, n), the modular multiplicative inverse, and Euler's totient φ(n) — exact, BigInt-backed, for integers of any size.
Compute a mod n, gcd(a, n), the modular multiplicative inverse, and Euler's totient φ(n) — exact, BigInt-backed, for integers of any size.