Number Theory Seminar: Nick Harland
Topic
The iterated Carmichael lambda function
Speakers
Details
Abstract
The 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 results about k=1,2 as well as sketch a proof of a normal order for n/\lambda_k(n) for all k.
The 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 results about k=1,2 as well as sketch a proof of a normal order for n/\lambda_k(n) for all k.
