Euler's Totient Function

rrzeszu2 08 Mar 2009 19:00

In class, we spent a lot of time discussing the the phi function, which counts up the number of integers less than n which are relatively prime to n. I was curious as to why this arithmetic function is referred to as the "totient" function. It turns out that if (a,n)=1 for integers a & n with 'a' less than or equal to 'n', we call 'a' a "totative" of n. I'll have to start busting out this word in class!