The Number of Solutions of λ(x) = n

DOI10.1515/INTEG.2011.029zbMATH Open1264.11082arXiv1010.5442MaRDI QIDQ3095097FDOQ3095097

Authors: Kevin Ford, Florian Luca 

Publication date: 28 October 2011

Published in: Integers (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1010.5442

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

zbMATH Keywords

Carmichael's conjectureCarmichael \(\lambda \) function

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Other results on the distribution of values or the characterization of arithmetic functions (11N64)

Cited In (4)

• Counting the solutions of \(\lambda_1 x_1^{k_1} + \dots + \lambda_t x_t^{k_t} \equiv c \bmod n\)
• Residue classes having tardy totients
• On the equation \(\tau (\lambda (n))=\omega (n)+k \)
• Hypothesis of Schinzel and Sierpiński and cyclotomic fields with isomorphic Galois groups

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)