This calculator determines Euler's Totient Function, φ(n), which counts the positive integers up to a given integer n that are relatively prime to n. Useful for students and enthusiasts of number theory.
The calculations are based on Euler's Totient Function formula from Wikipedia. All calculations strictly follow the mathematical principles outlined.
If n = p1a1 × p2a2 × ... × pkak, then φ(n) = n × (1 - 1/p1) × (1 - 1/p2) × ... × (1 - 1/pk).
For n = 10, the prime factors are 2 and 5. Thus, φ(10) = 10 × (1 - 1/2) × (1 - 1/5) = 4.
It is a function that counts the number of integers up to n that are coprime to n.
It is used in number theory, particularly in the field of cryptography.
Enter an integer and click calculate to find the totient of that integer.
The calculator only works with positive integers.