Dense admissible sets

DOI10.1007/BFB0054864MaRDI QIDQ3840164zbMATH OpenFDO

Authors Daniel M. Gordon, Gene Rodemich

Publication date 10 September 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0054864

zbMATH Keywords

applications of sievesdense admissible setsHardy-Littlewood conjectureprime \(k\)-tuplets conjectureprime counting functionsize of the largest admissible set

Mathematics Subject Classification ID

Distribution of primes (11N05) Applications of sieve methods (11N36)

Review text

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

Recommendations

• Dense admissible sequences
• Determined admissible sets
• Densing sets
• Dense sets and irresolvable spaces
• scientific article; zbMATH DE number 4057500
• Remarks on dense sets
• Dense sets in weak structure and minimal structure
• Dense convex sets
• Dense sets of measures
• scientific article; zbMATH DE number 2021470

Cited in

(13)

• Density functions for prime and relatively prime numbers
• An inequality for the function \(\pi(n)\)
• Dense admissible sequences
• Variants of the Selberg sieve, and bounded intervals containing many primes
• Computation of Jacobsthal's function \(h(n)\) for \(n<50\).
• scientific article; zbMATH DE number 44633 (Why is no real title available?)
• Prime clusters and Cunningham chains
• On the incompatibility of two conjectures concerning primes; a discussion of the use of computers in attacking a theoretical problem
• Two algorithms to find primes in patterns
• scientific article; zbMATH DE number 4197976 (Why is no real title available?)
• On Some Inequalities Concerning π(x)
• On a recursively defined sequence involving the prime counting function
• Inequalities involving arithmetic functions

This page was built for publication: Dense admissible sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840164)