Main menu

Euler's totient function

Euler's totient function, denoted by, ϕ(n), is a mathematical function that counts the number of positive integers less than or equal to n and also are coprime to n. In other words, ϕ(n) gives the count of integers between 1 and n inclusive, that do not share any common factors with n other than 1.

Euler's totient function has various applications in number theory and cryptography, particularly in the RSA encryption algorithm.

Calculator