Carmichael function
Generated by GPT-5-miniExpansion Funnel Raw 65 → Dedup 0 → NER 0 → Enqueued 0
| Carmichael function | |
|---|---|
| Name | Carmichael function |
| Symbols | λ(n) |
| Field | Number theory |
| Introduced | 1922 |
| Named after | R. D. Carmichael |
Carmichael function The Carmichael function is an arithmetic function in number theory that assigns to each positive integer n the smallest positive integer m such that a^m ≡ 1 (mod n) for all integers a coprime to n. It refines notions introduced by Leonhard Euler and complements results of Joseph-Louis Lagrange, Évariste Galois, and Carl Friedrich Gauss in the study of residue classes and multiplicative groups modulo n. The function appears in contexts connected to RSA (cryptosystem), pseudoprime testing, and the theory developed by Paul Erdős, Alfred Tarski, and John von Neumann in algebraic structures.
Definition and basic properties
For a positive integer n, λ(n) is defined as the exponent of the multiplicative group of units (the group of invertible residues) modulo n, i.e., the least common multiple of the orders of all elements in that group. This connects directly to the structure theorems for finite abelian groups used by Camille Jordan and Issai Schur. Key properties include multiplicativity on coprime arguments, bounds related to n and Euler’s totient function φ(n), and behavior determined by prime-power factorization influenced by results of Srinivasa Ramanujan, G. H. Hardy, and Otto Hölder. For odd prime powers p^k, λ(p^k)=φ(p^k) by classical work extending Euler; for powers of two the values follow a pattern tied to cyclic and noncyclic structure analyzed by Arthur Cayley and Frobenius.
Computation and formulae
Computation relies on prime factorization n=∏ p_i^{e_i} and properties of finite abelian groups examined by David Hilbert and Emmy Noether. For relatively prime factors the function is multiplicative: λ(n)=lcm(λ(p_i^{e_i})). Closed forms: for odd primes p, λ(p^e)=p^{e-1}(p-1), reflecting Euler's phi; for 2^e, λ(2)=1, λ(4)=2, and λ(2^e)=2^{e-2} for e≥3, a pattern linked to work of Leopold Kronecker and Émile Borel. Practical computation uses algorithms for factorization developed by John Pollard, Carl Pomerance, and implementations building on methods of Andrew Granville and H. W. Lenstra. Complexity considerations connect to research by Manuel Blum, Mihail B. Rabin, and complexity classes studied by Stephen Cook.
Relationship to Euler's totient and modular arithmetic
λ(n) divides φ(n) in general, reflecting subgroup exponent properties in multiplicative groups modulo n seen in Gauss's Disquisitiones Arithmeticae and elaborated by Leopold Kronecker and Ernst Kummer. While Euler's theorem states a^{φ(n)}≡1 (mod n) for gcd(a,n)=1, λ(n) often gives a smaller exponent, paralleling refinements by Évariste Galois in finite field theory and by Richard Dedekind on modular arithmetic. The Carmichael function governs the exponent of the group (Z/nZ)^×, and its relation to primitive roots ties into results concerning cyclic groups studied by Niels Henrik Abel and Évariste Galois. Comparative inequalities and density results have been investigated by Paul Erdős, K. Ford, and Erdős–Kac-type probabilistic methods used by B. Bollobás.
Cryptographic relevance and applications
λ(n) is central to the security analysis of RSA (cryptosystem) because the private exponent can be taken modulo λ(n), influencing key generation and attacks studied by Adi Shamir, Ron Rivest, Leonard Adleman, and Michael Rabin. Knowledge of λ(n) allows reduction of exponents in modular exponentiation, with implications for side-channel and factoring attacks analyzed by Daniel Bleichenbacher, Paul Kocher, and Moxie Marlinspike. The function also appears in pseudoprime and probable-prime testing frameworks developed by Rabin–Miller testers and in patterns exploited by algorithms from Henri Cohen and M. O. Rabin. Research on using λ(n) in cryptographic protocols links to studies by Silvio Micali, Shafi Goldwasser, and Sandy Frankel on one-way functions and trapdoor permutations.
Examples and tables of values
For small integers the factorization-driven rules yield concrete values consistent with tables compiled in computational projects led by The On-Line Encyclopedia of Integer Sequences contributors and investigators such as Paul Zimmerman. Examples: λ(1)=1; λ(2)=1; λ(3)=2; λ(4)=2; λ(5)=4; λ(6)=2 (lcm of λ(2)=1 and λ(3)=2); λ(7)=6; λ(8)=2^{8-2}=4; λ(9)=6. Larger examples used in studies by E. Bach and J. Sorenson show behavior for composite RSA moduli and Carmichael numbers discussed by R. D. Carmichael and investigated by W. S. Smyth. Extensive tables accompany computational number theory texts by Richard Brent and Barry Mazur.
Generalizations and related functions
Generalizations include the notion of the exponent of an arbitrary finite group studied by William Burnside and the use of lambda-like maps in algebraic number theory tied to Ernst Eduard Kummer and David Hilbert's class field theory. Related arithmetic functions are Euler's totient φ(n), Jordan's totient function J_k(n) introduced by Camille Jordan, and functions appearing in multiplicative order research by Hans Zassenhaus and Srinivasan Ramanujan. Studies of Carmichael-like behavior in residuosity and group exponents involve specialists such as Andrew Odlyzko, Enrico Bombieri, and Harald Helfgott.