Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

preprint · arXiv (Cornell University) · 2011

The iterated Carmichael lambda function

Nick Harland

Cited by 0Open access

Abstract

The Carmichael lambda function $λ(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 $λ_k(n)$ is defined to be the $k$th iterate of $λ(n).$ Previous results show a normal order for $n/λ_k(n)$ where $k=1,2.$ We will show a normal order for all $k.$

Cite this paper

APA 7

Harland, N. (2011). The iterated Carmichael lambda function. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1111.3667

MLA 9

Harland, Nick. “The iterated Carmichael lambda function.” arXiv (Cornell University), 2011, https://doi.org/10.48550/arxiv.1111.3667.

Chicago

Harland, Nick. 2011. “The iterated Carmichael lambda function.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1111.3667.

Harvard

Harland, N. (2011) ‘The iterated Carmichael lambda function’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.1111.3667.

BibTeX
@misc{harland2011iterated,
  title = {{The iterated Carmichael lambda function}},
  author = {Harland, Nick},
  journal = {arXiv (Cornell University)},
  year = {2011},
  doi = {10.48550/arxiv.1111.3667}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers