The number of solutions of lambda(x)=n
Number Theory
2014-03-24 v2
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.
Keywords
Cite
@article{arxiv.1010.5442,
title = {The number of solutions of lambda(x)=n},
author = {Kevin Ford and Florian Luca},
journal= {arXiv preprint arXiv:1010.5442},
year = {2014}
}
Comments
v2. Corrected minor error on page 2. Updated reference [3]