Explicit uniform prime intervals in arithmetic progressions on GRH

Assume the generalized Riemann hypothesis. Let q ≥ 3 and (b, q) = 1. This preprint proves that the interval (x, x + 0.86 φ(q) √x log x] contains a prime p ≡ b (mod q) for every x ≥ (720 φ(q) log q)². With the coefficient c* = 681/800 = 0.85125 of the author's earlier preprint (doi:10.5281/zenodo.24416983), the same holds for every x ≥ (10⁴ φ(q) log q)², and for every x ≥ (1300 φ(q) log q)² when q ≤ 10²⁰⁰⁰. For 3 ≤ q ≤ 100 and both coefficients, the interval contains such a prime for every real x ≥ x₀(q), with x₀(q) ≤ 53. These results make explicit the threshold in Theorem 2 of the earlier preprint. The proof uses a smoothed explicit formula with two rational Fourier witnesses, the zero-counting bounds of Bellotti–Wong and of Bennett–Martin–O'Bryant–Rechnitzer, and the large sieve for the exterior primes. All numerical steps are certified in 128-bit interval arithmetic (Arb through python-flint). A segmented sieve up to 6·10⁹ covers the small moduli. The supplement prime-progressions-grh-supplement.zip contains the LaTeX source, the rational witnesses, the interval-arithmetic verifiers, the segmented sieve, their JSON outputs, a README with the commands, and SHA-256 checksums. The SHA-256 table in the paper lists the same files. This preprint has not been peer reviewed. AI tools assisted in developing the analytic estimates, writing the interval-arithmetic verifiers and the sieve, and preparing the manuscript.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24429674
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Explicit uniform prime intervals in arithmetic progressions on GRH

Rafael Blanquer Robles
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Explicit uniform prime intervals in arithmetic progressions on GRH

Rafael Blanquer Robles
preprint en

Abstract

Assume the generalized Riemann hypothesis. Let q ≥ 3 and (b, q) = 1. This preprint proves that the interval (x, x + 0.86 φ(q) √x log x] contains a prime p ≡ b (mod q) for every x ≥ (720 φ(q) log q)². With the coefficient c* = 681/800 = 0.85125 of the author's earlier preprint (doi:10.5281/zenodo.24416983), the same holds for every x ≥ (10⁴ φ(q) log q)², and for every x ≥ (1300 φ(q) log q)² when q ≤ 10²⁰⁰⁰. For 3 ≤ q ≤ 100 and both coefficients, the interval contains such a prime for every real x ≥ x₀(q), with x₀(q) ≤ 53. These results make explicit the threshold in Theorem 2 of the earlier preprint. The proof uses a smoothed explicit formula with two rational Fourier witnesses, the zero-counting bounds of Bellotti–Wong and of Bennett–Martin–O'Bryant–Rechnitzer, and the large sieve for the exterior primes. All numerical steps are certified in 128-bit interval arithmetic (Arb through python-flint). A segmented sieve up to 6·10⁹ covers the small moduli. The supplement prime-progressions-grh-supplement.zip contains the LaTeX source, the rational witnesses, the interval-arithmetic verifiers, the segmented sieve, their JSON outputs, a README with the commands, and SHA-256 checksums. The SHA-256 table in the paper lists the same files. This preprint has not been peer reviewed. AI tools assisted in developing the analytic estimates, writing the interval-arithmetic verifiers and the sieve, and preparing the manuscript.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon