Carmichael function
The value of the Carmichael function^{} (or universal^{} exponent function or reduced totient function) $\psi (n)$ (or $\lambda (n)$) for a given positive integer $n$ is the smallest exponent $m$ such that for any $k$ coprime^{} to $n$ the congruence^{} ${k}^{m}\equiv 1modn$ is always true.
When $n$ is a prime or a square of a prime, the equality $\psi (n)=\varphi (n)$ holds (where $\varphi (n)$ is Euler’s totient function).
For powers of 2 greater than 4,
$$\psi ({2}^{a})=\frac{\varphi ({2}^{a})}{2}$$ |
(with $a>2$).
For all other positive integers the value of Carmichael’s function is the least common multiple^{} of all the dividing primes raised to the appropriate powers (e.g., to calculate $\psi (504)$ we’d reckon $\psi ({2}^{3})$, $\psi ({3}^{2})$ and $\psi (7)$ and find the LCM of these).
Sequence^{} A002322 in Sloane’s OEIS gives values of $\psi (n)$ for $$.
So, for example, $\psi (16)=4$. This means that any odd number^{} raised to the fourth power is one more than a multiple of 16. If we take a few small odd numbers in order and raise them to the fourth power, we get the sequence 1, 81, 625, 2401, 6561, 14641, 28561, 50625, 83521, 130321, 194481. Subtracting 1 from each of these and dividing by 16 we get the integers 0, 5, 39, 150, 410, 915, 1785, 3164, 5220, 8145, 12155.
Of course from Fermat’s little theorem we can deduce that $\varphi (n)$ will give us an exponent to which we can raise any number coprime to $n$ and get a number satisfying the congruence. $\psi (n)$ often gives us a smaller exponent than $\varphi (n)$ for composite $n$ that are not squares of primes. Among the first thousand positive integers, this is true 86% of the time. Sequence A104194 gives $\varphi (n)-\psi (n)$ for $$; it has many instances of 0.
In Sloane and Plouffe’s book The Encyclopedia of Integer Sequences the authors use the Greek letter $\psi $ for this function, the OEIS follows this custom but acknowledges the widespread use of $\lambda $. In Mathematica, the function is a built-in function, CarmichaelLambda[n]
, so naturally Mathworld also uses $\lambda $, and so does Wikipedia.
References
- 1 G. P. Lowecke, The Lore of Prime Numbers^{}. New York: Vantage Press (1982): 81 - 82
- 2 H. Griffin, Elementary Theory of Numbers. New York: McGraw-Hill (1954): 50
- 3 N. Sloane & S. Plouffe The Encyclopedia of Integer Sequences New York: Academic Press (1995): N0110
- 4 I. Vardi, Computational Recreations in Mathematica. Redwood City: Addison-Wesley (1991): 226
Title | Carmichael function |
---|---|
Canonical name | CarmichaelFunction |
Date of creation | 2013-03-22 17:13:47 |
Last modified on | 2013-03-22 17:13:47 |
Owner | PrimeFan (13766) |
Last modified by | PrimeFan (13766) |
Numerical id | 6 |
Author | PrimeFan (13766) |
Entry type | Definition |
Classification | msc 11A25 |
Synonym | least universal exponent function |
Synonym | reduced totient function |