TOPICS
Search

Reduced Totient Function


The reduced totient function lambda(n), also called the Carmichael lambda function or least universal exponent function, is the least positive integer m such that

 a^m=1  (modn)

for every integer a relatively prime to n. Equivalently, lambda(n) is the exponent of the modulo multiplication group modulo n.

If n=product_(i)p_i^(alpha_i) is the prime factorization of n, then

 lambda(n)=LCM[lambda(p_i^(alpha_i))]_i,

where lambda(p^alpha)=phi(p^alpha) for an odd prime p or for p=2 and alpha<=2, while lambda(2^alpha)=phi(2^alpha)/2 for alpha>=3. Here phi is the totient function.

This is the standard meaning of Carmichael function. A second function also historically called Carmichael's function is distinguished in that entry.


See also

Carmichael Function, Modulo Multiplication Group, Totient Function

Explore with Wolfram|Alpha

References

Ribenboim, P. The Book of Prime Number Records, 2nd ed. New York: Springer-Verlag, p. 27, 1989.Riesel, H. "Carmichael's Function." Prime Numbers and Computer Methods for Factorization, 2nd ed. Boston, MA: Birkhäuser, pp. 273-275, 1994.

Cite this as:

Weisstein, Eric W. "Reduced Totient Function." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ReducedTotientFunction.html

Subject classifications