Modular multiplicative inverse

The modular multiplicative inverse of a number m is a number n such that:

$n^{-1}=1{\pmod {m}}$

If m and n are coprime then the modular multiplicative inverse can easily be found using the Extended Euclidean algorithm by inputting gcd(n, m). The result is the multiplier to the first argument.