This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)

CarmichaelLambda

CarmichaelLambda[n]
gives the Carmichael function , defined as the smallest integer such that for all relatively prime to .
  • Integer mathematical function, suitable for both symbolic and numerical manipulation.
The first 10 values of CarmichaelLambda:
Plot the sequence:
The first 10 values of CarmichaelLambda:
In[1]:=
Click for copyable input
Out[1]=
 
Plot the sequence:
In[1]:=
Click for copyable input
Out[1]=
Evaluate for moderately large integers:
CarmichaelLambda threads element-wise over lists:
CarmichaelLambda works for negative integers:
Find Carmichael numbers []:
Find their factorization:
Find integers k such that :
Build RSA-like toy encryption scheme. Start with the modulus:
Find the universal exponent of the multiplication group modulo n:
Private key:
Public key:
Encrypt a message:
Decrypt it:
Model the Carmichael function based on the definition []:
Check Carmichael's theorem []:
Use FullSimplify to simplify expressions containing CarmichaelLambda:
Curious property of CarmichaelLambda:
New in 4