Langbahn Team – Weltmeisterschaft

Carmichael function: Difference between revisions

Content deleted Content added
Line 28: Line 28:
==Hierarchy of results==
==Hierarchy of results==


The classical [[Euler's theorem]] implies that λ(''n'') divides φ(''n''), the [[Euler's totient function]]. In fact Carmichael's theorem is related to Euler's theorem, because the exponent of [[finite abelian group]] must divide the order of the group, a fact of group theory. The two functions differ already in small cases: λ(15) = 4 while φ(15) = 8.
The classical [[Euler's theorem]] implies that λ(''n'') divides φ(''n''), the [[Euler's totient function]]. In fact Carmichael's theorem is related to Euler's theorem, because the exponent of [[finite abelian group]] must divide the order of the group, by elementary group theory. The two functions differ already in small cases: λ(15) = 4 while φ(15) = 8.


[[Fermat's little theorem]] is the special case of Euler's theorem in which ''n'' is a prime number ''p''. Carmichael's theorem for a prime ''p'' adds nothing to Fermat's theorem, because the group in question is a [[cyclic group]] for which the order and exponent are both ''p'' − 1.
[[Fermat's little theorem]] is the special case of Euler's theorem in which ''n'' is a prime number ''p''. Carmichael's theorem for a prime ''p'' adds nothing to Fermat's theorem, because the group in question is a [[cyclic group]] for which the order and exponent are both ''p'' − 1.

Revision as of 08:12, 7 April 2006

In number theory, the Carmichael function of a positive integer , denoted , is defined as the smallest integer such that

for every integer that is coprime to .

In other words, in more algebraic terms, it defines the exponent of the multiplicative group of residues modulo n.

Carmichael's theorem

This function can also be defined recursively, as follows.

For prime and positive integer such that or :

(This is equal to φ )

For integer ,

.

For distinct primes and positive integers :

where denotes the least common multiple.

Carmichael's theorem states that if a is coprime to n, then

,

where is the Carmichael function defined recursively. In other words, it asserts the correctness of the recursion.

Hierarchy of results

The classical Euler's theorem implies that λ(n) divides φ(n), the Euler's totient function. In fact Carmichael's theorem is related to Euler's theorem, because the exponent of finite abelian group must divide the order of the group, by elementary group theory. The two functions differ already in small cases: λ(15) = 4 while φ(15) = 8.

Fermat's little theorem is the special case of Euler's theorem in which n is a prime number p. Carmichael's theorem for a prime p adds nothing to Fermat's theorem, because the group in question is a cyclic group for which the order and exponent are both p − 1.

Properties of the Carmichael function

Average and typical value

Theorem 3 in [1]: For any , and a constant :

.

Theorem 2 in [1]: For all numbers and all except positive integers :

where is a constant, .

Lower bounds

Theorem 5 in [2]: For any sufficiently large number and for any , there are at most

positive integers such that .

Theorem 1 in [1]: For any sequence of positive integers, any constant , and any sufficiently large :

.

Small values

Theorem 1 in [1]: For a constant and any sufficiently large positive , there exists an integer such that . Moreover, is of the form

for some square-free integer .

See also

References

[1] Paul Erdős, Carl Pomerance, Eric Schmutz, Carmichael's lambda function, Acta Arithmetica, vol. 58, 363--385, 1991

[2] John Friedlander, Carl Pomerance, Igor E. Shparlinski, Period of the power generator and small values of the Carmichael function, Mathematics of Computation, vol. 70 no. 236, pp. 1591-1605, 2001