Euler Theorem

less than 1 minute read

Published:

$ gcd(a,n)=1 \Rightarrow a^{\varphi(n)} \equiv 1 \mod n$

Preliminary: Euler’s totient function

Defining $\varphi(n)$

Statement

Prove