scientific article; zbMATH DE number 1186944

MaRDI QIDQ3840164zbMATH OpenFDO

Authors Daniel M. Gordon, Gene Rodemich

Publication date 10 September 1999

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)

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:

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