Euler's totient function φ(n) counts the number of integers up to n which are coprime to n. Two numbers are coprime if their greatest common divisor is 1.
Where p are the prime factors of n.
This function is crucial in number theory and has applications in cryptography, particularly in RSA encryption.