Function mod_inverse 

pub fn mod_inverse(a: &BigInt, m: &BigInt) -> Option<BigInt>

The modular inverse a⁻¹ mod m via the extended Euclidean algorithm, or None if gcd(a, m) ≠ 1.