Paragraph

So in general, given the congruence

\begin{equation*} ax \equiv b \pmod{n}\text{,} \end{equation*}

if \(a\) and \(n\) are divisible by a number which \(b\) is not divisible by, then there will be no solutions. In fact, we really only need to check one divisor of \(a\) and \(n\text{:}\) the greatest common divisor. Thus, a more compact way to say this is:

in-context