Asymptotic formula for Carmichael numbers with three prime factors

Let C(x)C(x) denote the number of Carmichael numbers nxn\leq x with exactly three prime factors. Three-factor Carmichael number conjecture. As xx\to\infty, one has

C(x)Cx1/3log3x,C(x)\sim C\frac{x^{1/3}}{\log^3 x},

where CC is an absolute constant that can be given precisely. This asymptotic would provide the missing count for one of the two families attaining the maximal proportion of strong liars, but the source does not establish it or indicate that it has been resolved.

Sources & referencesView supporting material

Primary source

Eric Bach and Andrew Shallue, “Counting composites with two strong liars”, arXiv:1308.0880 (2013).

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.