Euler Theorem less than 1 minute read Published: September 21, 2015$ gcd(a,n)=1 \Rightarrow a^{\varphi(n)} \equiv 1 \mod n$Preliminary: Euler’s totient functionDefining $\varphi(n)$StatementProveShare on Twitter Facebook LinkedIn Previous Next