Dense clusters of primes in subsets

From MaRDI portal



Abstract: We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the parameters. As applications, we show there are infinitely many intervals of length (logx)epsilon containing ggepsilonloglogx primes, and show lower bounds of the correct order of magnitude for the number of strings of m congruent primes with pn+m−pnleepsilonlogx.




Cited in
(59)








This page was built for publication: Dense clusters of primes in subsets

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