Linear Congruence

To solve x ≡ mod
Your browser does not support the HTML5 canvas tag.


Summary:
For the linear equation ax ≡ b mod n,
if gcd(a, n) does not divide b, then the equation has no solution.
if gcd(a, n) = 1, then the equation has a unique solution mod n.
if gcd(a, n) = c divides b, then the equation has c solutions mod n.