= Solution For $a\ne0\pmod p$, $\gcd(a,p)=1$, so Bézout gives $au+pv=1$ and $u$ is an inverse modulo $p$.
Back to article page
