Skip to content
DraconiticResearch
Search Sources API
186,625 studies31 sourcesUpdated 8 min ago
PreprintarXiv licencearXiv

Bounded intervals containing a given number of primes

Abstract

Let m be a non-negative integer and f(x) a positive, non-decreasing function satisfying certain conditions. We give an explicit lower bound for the number of integers n≤ x such that #([n, n+f(n)] ∩ ℙ)=m for sufficiently large x, where ℙ denotes the set of prime numbers. This work extends the results of Mastrostefano and of Freiberg, and also makes the lower bound of Masrtrostefano explicit. In addition, we show that if the interval length is sufficiently large, then there exist infinitely many bounded intervals of the same length that contain exactly a prescribed number of primes.

Related

  1. Triangles minimize the Monge-Ampère eigenvalue among planar bounded convex domains of a given area
    Chong Gu
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
  2. Biases in the distribution of primes in short intervals
    Tristan Freiberg
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. Quasimodular Forms, Partitions, and Primes in Intervals
    Kevin Allen, William Craig
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. The Poisson Tail Conjecture for primes in short intervals
    Abhishek Jha
    arXivPreprintarXiv licenceFull textAlgebra & number theoryProbabilityarXiv
  5. Primes in short intervals assuming the Riemann hypothesis
    Matt Visser
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
BibTeX
@misc{sono2026bounded,
  title = {{Bounded intervals containing a given number of primes}},
  author = {Keiju Sono},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.18414},
  eprint = {2609.18414},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.18414},
}
RIS
TY  - UNPB
TI  - Bounded intervals containing a given number of primes
AU  - Keiju Sono
PY  - 2026
DA  - 2026/09/16
PB  - arXiv
DO  - 10.48550/arxiv.2609.18414
UR  - https://arxiv.org/abs/2609.18414
AB  - Let m be a non-negative integer and f(x) a positive, non-decreasing function satisfying certain conditions. We give an explicit lower bound for the number of integers n≤ x such that #([n, n+f(n)] ∩ ℙ)=m for sufficiently large x, where ℙ denotes the set of prime numbers. This work extends the results of Mastrostefano and of Freiberg, and also makes the lower bound of Masrtrostefano explicit. In addition, we show that if the interval length is sufficiently large, then there exist infinitely many bounded intervals of the same length that contain exactly a prescribed number of primes.
ER  -