The number of iterates of the Carmichael lambda function required to reach 1

Details The number of iterates of the Carmichael lambda function required to reach 1 The number of iterates of the Carmichael lambda function required to reach 1

2012-03-21

arxiv.org/abs/1203.4791v1

Mathematics

Number Theory

9 pages

Scientific paper

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).$ Let L(n) be the smallest $k$ for which $\lambda_k(n)=1.$ It's easy to show that $L(n) \ll \log n.$ It's conjectured that $L(n)\asymp \log\log n,$ but previously it was not known to be $o(\log n)$ for almost all $n.$ We will show that $L(n) \ll (\log n)^{\delta}$ for almost all $n,$ for some $\delta <1.$ We will also show $L(n) \gg \log\log n$ for almost all $n$ and conjecture a normal order for L(n).

Affiliated with

Also associated with

No associations

Rating

The number of iterates of the Carmichael lambda function required to reach 1 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The number of iterates of the Carmichael lambda function required to reach 1, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The number of iterates of the Carmichael lambda function required to reach 1 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-488963