English

Long gaps in sieved sets

Number Theory 2023-11-01 v4

Abstract

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

Keywords

Cite

@article{arxiv.1802.07604,
  title  = {Long gaps in sieved sets},
  author = {Kevin Ford and Sergei Konyagin and James Maynard and Carl Pomerance and Terence Tao},
  journal= {arXiv preprint arXiv:1802.07604},
  year   = {2023}
}

Comments

Corrects a number of errors in the published version pointed out to us by Mikhail Gabdullin. The specific corrections are listed in an Appendix. One of these causes a slight degradation of the numerical values for the exponents of log log x in Theorem 1 and Corollaries

R2 v1 2026-06-23T00:28:54.726Z