📖 Multiplicative Inverse
If $\\gcd(a, m) = 1$, then $a$ has a multiplicative inverse modulo $m$: an integer $a^{-1}$ such that $a \\cdot a^{-1} \\equiv 1 \\pmod{m}$.
From: Disquisitiones Arithmeticae
Learn more: https://gauss-deploy.vercel.app/#/section/1
Explore all courses: https://mathacademy-cyan.vercel.app