Difference between revisions of "Carmichael function"

Revision as of 10:55, 1 August 2022

There are two different functions called the Carmichael function. Both are similar to Euler's totient function $\phi$ .

First Definition

The Carmichael function $\lambda$ is defined at $n$ to be the smallest positive integer $\lambda(n)$ such that $a^{\lambda(n)} \equiv 1\pmod {n}$ for all positive integers $a$ relatively prime to $n$ . The order of $a\pmod {n}$ always divides $\lambda(n)$ .

This function is also known as the reduced totient function or the least universal exponent function.

Suppose $n=p_1^{\alpha_1}\cdot p_2^{\alpha_2}\cdots p_k^{\alpha_k}$ . We have

$\lambda(n) = \begin{cases} \phi(n) & \mathrm {for}\ n=p^{\alpha},\ \mathrm {with}\ p=2\ \mathrm {and}\ \alpha\le 2,\ \mathrm {or}\ p\ge 3\\ \frac{1}{2}\phi(n) & \mathrm {for}\ n=2^{\alpha}\ \mathrm {and}\ \alpha\ge 3\\ \mathrm{lcm} (\lambda(p_1^{\alpha_1}), \lambda(p_2^{\alpha_2}), \ldots, \lambda(p_k^{\alpha_k})) & \mathrm{for}\ \mathrm{all}\ n. \end{cases}$

Examples

Evaluate $2009^{2009}\pmod{1000}$ . [1]

Second Definition

The second definition of the Carmichael function is the least common multiples of all the factors of $\phi(n)$ . It is written as $\lambda'(n)$ . However, in the case $8|n$ , we take $2^{\alpha-2}$ as a factor instead of $2^{\alpha-1}$ .

@@ Line 27: / Line 27: @@
 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>.
-{{stub}}
 == See also ==

Page

Toolbox

Search

Difference between revisions of "Carmichael function"

Revision as of 10:55, 1 August 2022

Contents

First Definition

Examples

Second Definition

See also