ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λ(n)\lambda(n) be the Carmichael lambda function, defined as the exponent of (Z/nZ)×(\mathbb{Z}/n\mathbb{Z})^{\times}, and define its iterates by

λ0(n)=n,λk(n)=λ(λk−1(n))(k≥1).\lambda_0(n)=n,\qquad \lambda_k(n)=\lambda(\lambda_{k-1}(n))\quad (k\geq 1).

Let L(n)L(n) be the smallest non-negative integer kk such that λk(n)=1\lambda_k(n)=1. The normal-order conjecture for L(n)L(n). The normal order of L(n)L(n) is elog⁡log⁡ne\log\log n. This is motivated by a probabilistic model for the related Pratt-tree height H(p)H(p), whose conjectured normal order is elog⁡log⁡pe\log\log p. The paper provides evidence for the corresponding assertion for L(n)L(n), while the stated normal-order claim remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.