Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Mathematica > Mathematics and Algorithms > Mathematical Functions > Number Theoretic Functions >

CarmichaelLambda

CarmichaelLambda[n]
gives the Carmichael function lambda(n), defined as the smallest integer m such that k^m=1mod n for all k relatively prime to n.
  • Integer mathematical function, suitable for both symbolic and numerical manipulation.
The first ten values of CarmichaelLambda:
Plot the sequence:
Evaluate for moderately large integers:
CarmichaelLambda threads element-wise over lists:
CarmichaelLambda works for negative integers:
Find Carmichael numbers [more info]:
Find their factorization:
Find integers k such that phi(InterpretationBox[lambda, CarmichaelLambda, Editable -> False, Selectable -> False](k))-InterpretationBox[lambda, CarmichaelLambda, Editable -> False, Selectable -> False](phi(k))⩵0:
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 [more info]:
Check Carmichael's theorem [more info]:
Use FullSimplify to simplify expressions containing CarmichaelLambda:
Curious property of CarmichaelLambda:
New in 4
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team