Definition of the Euler Totient Function
Click on the image for a detailed proof
\varphi(n):= \sum_{\substack{k=1\\(k,n)=1}}^{n} 1
The Euler Totient Function counts the positive integers up to a given number n that are relatively prime to it.
First introduced by Euler in 1763, the function received its name “totient” more than one hundred years later, thanks to J.J. Sylvester.
Currently, it remains a central topic in number theory research.
Any questions?
Feel free to contact our authors at: [email protected], you will be put directly in touch with the person who wrote the text.
Didn’t find what you were looking for? Keep looking through all our formulas regarding the Riemann Zeta Function!
