Science Fair Project Encyclopedia
Carmichael function
In number theory, the Carmichael function of a positive integer n, denoted λ(n), is defined as the smallest integer m such that
for every integer a that is coprime to n.
This function can also be defined recursively, as follows.
For prime p and positive integer k such that
or
:
- λ(pk) = pk - 1(p - 1).
For integer
,
- λ(2k) = 2k - 2.
For distinct primes
and positive integers
:
where lcm denotes the least common multiple.
See also
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


