Linear congruence (source code)

= Linear congruence

A linear congruence has the form $ax\equiv b\pmod n$. It has a solution exactly when $\gcd(a,n)$ divides $b$.