New answers tagged

2 votes

Testing whether the Euler Totient of a number equals to certain value

Yes, though it is not completely straightforward. There is a tighter form of Euler's theorem for composite numbers that says that $a^{\lambda(n)}\equiv 1\pmod n$ for $(a,n)=1$ where $\lambda(n)$ is ...
Daniel S's user avatar
  • 22.9k

Top 50 recent answers are included