Why is Euler's totient function equal to (p-1)(q-1) when N=pq and p and q are prime?
Why is Euler's totient function equal to $(p-1)(q-1)$ when $N=pq$ and $p$ and $q$ are prime in a clean intuitive way?