Eulers Theorem

$x^{\varphi (n)}\equiv 1\mathrm{mod}n$ ( x and n needs to be coprime)
This means that $x^{\varphi (n)}/n$ remainder will be 1
$x^{\varphi (n)a}\equiv 1\mathrm{mod}n$ (Also holds true)