Lowest Power for Euler Totient Function

151 Views Asked by At

If I use the Euler Totient to find the solution of $9^x\equiv1 \pmod{10}$, It gives $x=4$. However $x=2$ also works. Is there a function that gets the smallest $x$ that is a solution? In other terms, is there a function that directly gives the order?