Effective exponential bounds on the prime gaps
Abstract
Over the last 50 years a large number of effective exponential bounds on the first Chebyshev function (x) have been obtained. Specifically we shall be interested in effective exponential bounds of the form \[ |(x)-x| < a \;x \;( x)b \; (-c\; x); (x ≥ x0). \] Herein we shall convert these effective bounds on (x) into effective exponential bounds on the prime gaps gn = pn+1-pn. Specifically we shall establish a number of effective exponential bounds of the form \[ gn pn < 2a \;( pn)b \; (-c\; pn) 1- a \;( pn)b \; (-c\; pn); (x ≥ x*); \] and \[ gn pn < 3a \;( pn)b \; (-c\; pn); (x ≥ x*); \] for some effective computable x*. It is the explicit presence of the exponential factor, with known coefficients and known range of validity for the bound, that makes these bounds particularly interesting.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.