Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Long gaps in sieved sets (1802.07604v4)

Published 21 Feb 2018 in math.NT

Abstract: For each prime $p$, let $I_p \subset \mathbb{Z}/p\mathbb{Z}$ denote a collection of residue classes modulo $p$ such that the cardinalities $|I_p|$ are bounded and about $1$ on average. We show that for sufficiently large $x$, the sifted set ${ n \in \mathbb{Z}: n \pmod{p} \not \in I_p \hbox{ for all }p \leq x}$ contains gaps of size at least $x (\log x){\delta} $ where $\delta>0$ depends only on the density of primes for which $I_p\ne \emptyset$. This improves on the "trivial" bound of $\gg x$. As a consequence, for any non-constant polynomial $f:\mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient, the set ${ n \leq X: f(n) \hbox{ composite}}$ contains an interval of consecutive integers of length $\ge (\log X) (\log\log X){\delta}$ for sufficiently large $X$, where $\delta>0$ depends only on the degree of $f$.

Summary

We haven't generated a summary for this paper yet.