Runs of integers with constant values of the Carmichael function
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\).
- Arithmetic functions that remain constant on runs of consecutive integers
- Bertrand’s Postulate for Carmichael Numbers
- scientific article; zbMATH DE number 575870 (Why is no real title available?)
- scientific article; zbMATH DE number 7675550 (Why is no real title available?)
- Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
- Note on a new number theory function.
- On composite numbers \(P\) which satisfy the Fermat congruence \(a^{P-1}\equiv 1\pmod P\).
- On the greatest prime factor of $p-1$ with effective constants
- Sets of monotonicity for Euler's totient function
- Shifted primes without large prime factors
- Some remarks on Euler’s 𝜙 function and some related problems
- There are infinitely many Carmichael numbers
This page was built for publication: Runs of integers with constant values of the Carmichael function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943857)
