Totient Function
The totient function $\latex \phi(n) \latex$ also called Euler's totient function, is defined as the number of positive integers less than n that are relatively prime to (i.e., do not contain any factor in common with) n, where 1 is counted as being relatively prime to all numbers.
For a prime p, $\latex \phi(p) = (p - 1) \latex$
page revision: 7, last edited: 04 May 2009 16:32
