The iterated Carmichael lambda function

Details The iterated Carmichael lambda function The iterated Carmichael lambda function

2011-11-15

arxiv.org/abs/1111.3667v1

Mathematics

Number Theory

Scientific paper

The Carmichael lambda function $\lambda(n)$ is defined to be the smallest
positive integer $m$ such that $a^m$ is congruent to 1 modulo $n,$ for all $a$
and $n$ relatively prime. The function $\lambda_k(n)$ is defined to be the
$k$th iterate of $\lambda(n).$ Previous results show a normal order for
$n/\lambda_k(n)$ where $k=1,2.$ We will show a normal order for all $k.$

Affiliated with

Also associated with

No associations

Rating

The iterated Carmichael lambda function 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 iterated Carmichael lambda function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The iterated Carmichael lambda function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-67674