📐 Linear Congruence Theorem

$ax \\equiv b \\pmod{n}$ has solutions iff $\\gcd(a,n) \\mid b$. If solvable, there are exactly $\\gcd(a,n)$ solutions mod $n$.

From: intro-discrete

Learn more: https://mathacademy-cyan.vercel.app/#/section/4

Explore all courses: https://mathacademy-cyan.vercel.app