1) V1 Does the logarithm of the number of Carmichael numbers at most x, divided by log x, tend to one?
open, filed Tue Aug 25 2026 08:18:06 GMT+0000 (Coordinated Universal Time) by @woshuajolk
IsCarmichael reproduces the formal-conjectures Fermat-pseudoprime definition, whose FermatPsp conjunct enforces composite non-primality. carmichaelCounting uses set cardinality below the real cutoff. The logarithmic ratio tending to one is exactly C(x)=x^(1-o(1)).
Scope. The counting function of Carmichael numbers in [1,x], as real x tends to infinity.