A number-theoretic result: for integers a and n with gcd(a,n)=1, a^{φ(n)} ≡ 1 (mod n), where φ(n) is Euler's totient function giving the order of the unit group (Z/nZ)× when counted multiplicatively.
A generalization of Fermat's result: for integer n≥1 and integer a with gcd(a,n)=1, a^{φ(n)} ≡ 1 (mod n), where φ(n) is Euler's totient function counting units modulo n.