next up previous
Next: More About GCDs Up: Lecture 7: Congruences, Part Previous: Lecture 7: Congruences, Part

How to Solve $ ax\equiv 1\pmod{n}$

Let $ a, n\in\mathbb{N}$ with $ \gcd(a,n)=1$. Then we know that $ ax\equiv 1\pmod{n}$ has a solution. How can we find $ x$?



Subsections

William A Stein 2001-09-25