## Carmichael Function Calculator

This calculator calculate the Carmichael function $\lambda(n)$ of a positive integer $n$. The function $\lambda(n)$ is the smallest positive integer such that \[ a^{\lambda(n)}\equiv 1\mod{n} \] for every integer $a$ that is relatively prime to $n$. We can use $\lambda(n)$ in the place of $\phi(n)$ in the Euler's theorem. For example, for $a=3$ and $n=8$ we have $\lambda(8)=2$ and $\phi(8)=4$ so we get \[ 3^2\equiv 1\mod{8}\] and \[3^4\equiv 1\mod{8}\] respectively.