pub fn div_mod(n: &BigInt, m: &BigInt, p: &BigInt) -> BigInt
Finds a nonnegative integer x < p such that (m * x) % p == n.