Computes the modular multiplicative inverse using the Extended Euclidean Algorithm Finds `x` such that `(a * x) % m == 1` # Arguments `a` - The number to find the inverse of `m` - The modulus # Returns The modular multiplicative inverse of `a` modulo `m`, or `None` if it doesn't exist
(a: i64, m: i64)
source not stored for this graph (policy: none)
no outgoing calls
no test coverage detected