
Glossary: Prime Pages: Top 5000: 
Euler's phi (or totient) function of a positive integer n is the number of integers in {1,2,3,...,n} which are relatively prime to n. This is usually denoted ,
but for those with nongraphical browsers we often use phi(n) on these pages.
Clearly for primes p, phi(p)=p1. Since phi(x) is a multiplicative function, its value can be determined from its value at the prime powers:
See Also: EulersTheorem
Chris K. Caldwell © 19992014 (all rights reserved)
