Infinitude conjecture for primary Carmichael numbers
Statement
Let denote the sum of the base- digits of , and let be the set of squarefree numbers such that for every prime factor of . Let be the set of Carmichael numbers.
Infinitude conjecture for primary Carmichael numbers. The following claims are true: the set is infinite, and the set is infinite.
The conjecture is supported by numerical data showing a slow but steady increase in the counting function for . It would imply another proof of the infinitude of Carmichael numbers and of the infinitude of the relevant squarefree set.
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.