Finds the modular multiplicative inverse of `a` modulo `m`. Uses the Extended Euclidean Algorithm to find x such that: (a * x) mod m = 1 # Arguments `a` - The number to find the inverse of `m` - The modulus # Returns `Some(inverse)` if the inverse exists, `None` otherwise
(a: i64, m: i64)
source not stored for this graph (policy: none)