]> Euler's Totient Function

Euler's Totient Function

Note: This page uses MathML. To view it properly, you need a MathML-enabled browser. You may also have to install some fonts.

Euler's totient function (also known as the "phi function") counts the number of natural integers less than n that are coprime to n. It is very useful in number theory, e.g. to compute the number of primitive roots modulo a prime n. For more information, see:

The values presented below were computed in 2015 using a Python program.

J.P. Martin-Flatin