Modular arithmetic operations: mod (a mod m), modpow (a^b mod m via fast exponentiation), and modinverse (a^-1 mod m via extended Euclidean algorithm). Uses BigInt for arbitrary precision. Useful for cryptography and number theory.