Work

A discrete ceiling bound on Prime gaps and a Shifted Modulo Prime Recursion

Year: 2026
Type: preprint
Abstract: 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.
Language: English
Open Access status: green
OpenAlex ID: W7226025475
Cites:
Cited by:
Related to: 10