Nick Harland

AbstractThe Carmichael lambda function \lambda(n) is defined to be the smallest positive integer m such that a^m \equiv 1 \pmod{n} for all (a,n)=1. \lambda_k(n) is defined to be the k th iterate of \lambda(n). We will discuss some previous known...