Dense admissible sets (Q3840164)

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 1186944
Language Label Description Also known as
default for all languages
No label defined
    English
    Dense admissible sets
    scientific article; zbMATH DE number 1186944

      Statements

      0 references
      0 references
      10 September 1999
      0 references
      dense admissible sets
      0 references
      Hardy-Littlewood conjecture
      0 references
      applications of sieves
      0 references
      prime \(k\)-tuplets conjecture
      0 references
      size of the largest admissible set
      0 references
      prime counting function
      0 references
      Dense admissible sets (English)
      0 references
      Let us call a set of integers \(\{b_1,b_2, \dots,b_k\}\) admissible if for any prime \(p\), at least one congruence class \(\pmod p\) does not contain any of the \(b_j\). Let \(\rho^*(x)\) be the size of the largest admissible set in \([1,x]\). The authors examine numerically the behaviour of \(\rho^*(x)\) and compare it with the prime counting function \(\pi(x)\). The subject is related to the prime \(k\)-tuplets conjecture and a conjecture of Hardy and Littlewood that for all integers \(x,y\geq 2\) we have \(\pi(x+y) \leq\pi(x)+ \pi(y)\) [cf. \textit{D. Hensley} and \textit{I. Richards}, Bull. Am. Math. Soc. 25, 375-391 (1974; Zbl 0285.10004)]. In particular the present authors compute \(\rho^*(x)\) for \(x<1639\) and find that \(\rho^*(1917)=\pi(1917)\). This extends previous computations by \textit{J. Selfridge} [unpublished] and \textit{N. C. Jarvis} [Master's thesis, Brigham Young University (1996)]. For the entire collection see [Zbl 0891.00022].
      0 references

      Identifiers