Math — Number Theory
Congruence, gcd–lcm, Fermat's little theorem and Euler's totient.
Rendering…
Make it your own.
a \equiv b \pmod{n}
\gcd(a,b)\cdot\operatorname{lcm}(a,b) = ab
a^{p-1} \equiv 1 \pmod{p}
\varphi(n) = n\prod_{p\mid n}\left(1 - \frac{1}{p}\right)