A discrete ceiling bound on Prime gaps and a Shifted Modulo Prime Recursion
By combining Rosser's explicit upper bound on the n-th prime with Dusart's short-interval prime existence theorem and a finite analysis of maximal prime gaps, we establish the discrete step-function upper bound P(n) - P(n-1) <= 2*ceil(n/4) for all n >= 3. As immediate corollaries, we obtain the linear bound P(n) - P(n-1) <= n/2 + 1.5 and show that consecutive primes satisfy the shifted modulo recursion P(n) = P(n-1) + 2*R_{ceil(n/4)}[x] for some natural number x, where R_k[x] = ((x-1) mod k) + 1.
Authors
- Sivakrishna C
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-13
- DOI
- https://doi.org/10.5281/zenodo.24187666
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint