Density of Carmichael numbers with three prime factors (Q4372644)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1097175
Language Label Description Also known as
default for all languages
No label defined
    English
    Density of Carmichael numbers with three prime factors
    scientific article; zbMATH DE number 1097175

      Statements

      Density of Carmichael numbers with three prime factors (English)
      0 references
      0 references
      0 references
      16 December 1997
      0 references
      Carmichael number
      0 references
      primality testing
      0 references
      Hardy-Littlewood prime 3-tuples conjecture
      0 references
      A Carmichael number is a composite number \(n\) that satisfies the condition \(a^n \equiv a \pmod n\) for all \(a\). It is easy to see that a Carmichael number must be squarefree and have at least three prime factors. Let \(C_3(x)\) denote the number of Carmichael numbers not exceeding \(x\) with exactly 3 prime factors. It is an open problem to show that \(C_3(x)\) is unbounded. However, the Hardy-Littlewood prime 3-tuples conjecture implies that \(C_3(x) \gg x^{1/3} \log^{-3}(x)\), and heuristically, one expects that \(C_3(x) \ll_\varepsilon x^{1/3+\varepsilon}\). In this paper, the authors prove that \(C_3(x) \ll_\varepsilon x^{5/14+\varepsilon}\). This improves an earlier estimate of \textit{I. Damgård, P. Landrock} and \textit{C. Pomerance} [Math. Comput. 61, 177-194 (1993; Zbl 0788.11059)], who had \(1/2\) in place of \(5/14\), and an unpublished result of the reviewer, who had \(2/5\) in place of \(5/14\). The proof starts from the fact that the numbers to be counted can be written in the form \(n=pqr\), where \(p,q,r\) are odd primes and \(n-1\) is divisible by all of \(p-1,q-1\), and \(r-1\). The authors use some elementary but clever techniques to bound the number of triples \((p,q,r)\) satisfying these conditions.
      0 references

      Identifiers