Banks–Ford–Luca conjecture on repeated values of Carmichael's function
Statement
Let be the Carmichael function, the largest order of any number modulo . Banks–Ford–Luca conjecture. For every positive integer , there is an integer with
This conjecture asserts that Carmichael's function never takes a value exactly once. The paper gives a near unconditional proof and a complete conditional proof under the Extended Riemann Hypothesis.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.