The Number of Solutions of λ(x) = n
From MaRDI portal
Publication:3095097
Abstract: We study the question of whether for each n there is another integer m with lambda(m)=lambda(n), where lambda is Carmichael's function. We give a "near" proof of the fact that this is the case unconditionally, and a complete conditional proof under the Extended Riemann Hypothesis. The main tool is a count of prime chains from paper arXiv:0906.3380.
Recommendations
- on the value set of the Carmichael λ-function
- The Impossibility of Certain Types of Carmichael Numbers
- Carmichael's Conjecture on the Euler Function is Valid Below 10^{10,000, 000}
- Two contradictory conjectures concerning Carmichael numbers
- On integers with a special divisibility property.
- Residue classes having tardy totients
- scientific article; zbMATH DE number 3706524
- On the Number of Carmichael Numbers up to x
- Coincidences in the values of the Euler and Carmichael functions
Cited in
(4)
This page was built for publication: The Number of Solutions of λ(x) = n
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095097)