Alternative way of calculating the multiplicative inverse Suppose I want to find the inverse of $7^{-1} \equiv 1 \mod 19 $, is there a quick way to do instead of extended euclidean algorithm? (Assume the numbers are not large).
Thank you

Yeah, the way most people do it in competitive programming is as follows:
Suppose you have a number $k$ that is coprime to $n$ and you want to find the inverse of $k$ mod $n$. Then it is just $k^{\varphi(n)-1}$.
You can calculate this really fast using exponentiation by squaring.
