Math — Number Theory
Congruences, gcd/lcm and the little theorems.
Rendering…
Make it your own.
a \equiv b \pmod{n} \iff n \mid (a-b)
\gcd(a,b)\cdot \operatorname{lcm}(a,b) = ab
a^{p-1} \equiv 1 \pmod{p}\quad(\text{Fermat})
a^{\varphi(n)} \equiv 1 \pmod{n}\quad(\text{Euler})