Difference between revisions of "Carmichael function"
(wiokify) |
|||
| Line 1: | Line 1: | ||
There are two different [[function]]s that are both called '''Carmichael function'''. Both are similar to [[Euler's totient function]] <math>\phi</math>. | There are two different [[function]]s that are both called '''Carmichael function'''. Both are similar to [[Euler's totient function]] <math>\phi</math>. | ||
| − | == | + | == First Definition == |
The Carmichael function <math>\lambda</math> is defined at <math>n</math> to be the smallest [[positive integer]] <math>\lambda(n)</math> such that <math>a^{\lambda(n)} \equiv 1\pmod {n}</math> for all positive [[integer]]s <math>a</math> [[relatively prime]] to <math>n</math>. The [[order]] of <math>a\pmod {n}</math> always divides <math>\lambda(n)</math>. | The Carmichael function <math>\lambda</math> is defined at <math>n</math> to be the smallest [[positive integer]] <math>\lambda(n)</math> such that <math>a^{\lambda(n)} \equiv 1\pmod {n}</math> for all positive [[integer]]s <math>a</math> [[relatively prime]] to <math>n</math>. The [[order]] of <math>a\pmod {n}</math> always divides <math>\lambda(n)</math>. | ||
| Line 20: | Line 20: | ||
=== Examples === | === Examples === | ||
| + | {{incomplete|section}} | ||
| − | == | + | == Second Ddefinition == |
The second definition of the Carmichael function is the least common multiples of all the factors of <math>\phi(n)</math>. It is written as <math>\lambda'(n)</math>. However, in the case <math>8|n</math>, we take <math>2^{\alpha-2}</math> as a factor instead of <math>2^{\alpha-1}</math>. | The second definition of the Carmichael function is the least common multiples of all the factors of <math>\phi(n)</math>. It is written as <math>\lambda'(n)</math>. However, in the case <math>8|n</math>, we take <math>2^{\alpha-2}</math> as a factor instead of <math>2^{\alpha-1}</math>. | ||
=== Examples === | === Examples === | ||
| − | + | {{incomplete|section}} | |
== See also == | == See also == | ||
| Line 32: | Line 33: | ||
* [[Modular arithmetic]] | * [[Modular arithmetic]] | ||
* [[Euler's totient theorem]] | * [[Euler's totient theorem]] | ||
| + | |||
| + | [[Category:Functions]] | ||
| + | [[Category:Number theory]] | ||
Revision as of 16:56, 6 January 2008
There are two different functions that are both called Carmichael function. Both are similar to Euler's totient function 
.
First Definition
The Carmichael function 
is defined at 
to be the smallest positive integer 
such that 
for all positive integers 
relatively prime to . The order of 
always divides .
This function is also known as the reduced totient function or the least universal exponent function.
Suppose 
. We have
Examples
Second Ddefinition
The second definition of the Carmichael function is the least common multiples of all the factors of 
. It is written as 
. However, in the case 
, we take 
as a factor instead of 
.
