Runs of integers with constant values of the Carmichael function (Q6943857)

For a given arithmetic function \(f\), let \(F_f(x)\) be the largest \(k\) for which the set of equalities \(f(n+1) = f(n+2) = \cdots = f(n+k)\) has a solution satisfying \(n+k\leq x\). In the paper under review, the authors approximate \(F_\lambda(x)\) for the Carmichael function \(\lambda(n)\), which is defined as the smallest number \(m\) for which the congruence \(a^m \equiv 1 \bmod{n}\) holds for all \(a\) coprime to \(n\). Because of similar symbol, this function should not be confused with the Liouville function. For the Carmichael function \(\lambda\) it is known that \(\lambda(n)=\varphi(n)\) if \(8 \nmid n\), and \(\lambda(n)=\varphi(n)/2\) if \(8\mid n\), where \(\varphi\) is the Euler function. In the present paper, the authors use a result due to \textit{R. C. Baker} et al. [Acta Arith. 83, No. 4, 331--361 (1998; Zbl 0994.11033)] to show that \(F_{\lambda}(x)\ll(\log x)^{1/0.677}\) as \(x\to\infty\).