scientific article
From MaRDI portal
Publication:3840164
zbMath0920.11065MaRDI QIDQ3840164
Daniel M. Gordon, Gene Rodemich
Publication date: 10 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hardy-Littlewood conjectureprime counting functionapplications of sievesdense admissible setsprime \(k\)-tuplets conjecturesize of the largest admissible set
Related Items (7)
Prime clusters and Cunningham chains ⋮ Variants of the Selberg sieve, and bounded intervals containing many primes ⋮ On a recursively defined sequence involving the prime counting function ⋮ An inequality for the function \(\pi(n)\) ⋮ Computation of Jacobsthal’s function $h(n)$ for $n<50$. ⋮ Two algorithms to find primes in patterns ⋮ On Some Inequalities Concerning π(x)
This page was built for publication:
