arXiv · 1010.5442
The number of solutions of lambda(x)=n
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.
Explore related subjects
Keep this discovery
Kevin Ford, Florian Luca. 2010-10-26. The number of solutions of lambda(x)=n. https://arxiv.org/abs/1010.5442
Cite the original work for its findings. Save a collection to share your selection of sources.