Function mod_inv 

pub fn mod_inv(a: u64, m: u64) -> u64

Modular inverse of a modulo m.

Returns the smallest non-negative integer x which satisfies a*x == 1 (mod m). Also works when m is composite, as long as a and m are coprime.

Panics if a and m are not coprime.