Carmichael function

From AoPSWiki

Revision as of 01:33, 4 January 2009 by Alexhhmun (Talk | contribs)

(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

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,\ ...$

Examples

This section is incomplete. You can help us out by completing it.

Evaluate $2009^{2009}$ (mod $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}$ .

Examples

This section is incomplete. You can help us out by completing it.

Personal tools

Navigation

Search

Toolbox

Carmichael function

From AoPSWiki

Contents

First Definition

Examples

Second Definition

Examples

See also