Order (Modulo)

For an Integer $n$ which is not a multiple of a number $a$, there exists a smallest exponent $k\geq 1$ such that $a^k\equiv 1\ \left({{\rm mod\ } {n}}\right)$, and $k$ is called the order of $a$ modulo $n$.

See also Carmichael Function