Which property correctly identifies why aϕ(n)≡1(modn)a^{\phi(n)} \equiv 1 \pmod{n}aϕ(n)≡1(modn) holds for gcd(a,n)=1\gcd(a, n) = 1gcd(a,n)=1?
Wilson's Theorem
Euler's Totient Theorem
Chinese Remainder Theorem
Fermat's Little Theorem