Infinitude conjecture for primary Carmichael numbers
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.
References
- Bernd C. Kellner and Jonathan Sondow, “On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-p digits”, arXiv:1902.10672 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.