Effective short intervals containing primes
Abstract
95 years ago Hoheisel proved the existence of primes in the sub-linear interval \[ [x, x+x1-1 33000] for x sufficiently large. \] This was improved by Heilbronn, proving existence of primes in the interval \[ [x, x+x1-1 250] for x sufficiently large. \] More recently Baker, Harman, Pintz proved existence of primes in the interval \[ [x, x+ x1-19 40] for x sufficiently large. \] In the present article I will, to the extent possible, make some of these statements effective. Specifically, among other things, I shall show that \[ ∀ n ≥ 4, ∀ x ≥ ((33)), there are primes in the interval [x, x+ x1-1 n]; \] \[ ∀ n ≥ 91, ∀ x ≥ [9090]n/(n-90) , there are primes in the interval [x, x+ x1-1 n]. \] Furthermore \[ ∀ n ≥ 106, ∀ x ≥ 1, there are primes in the interval [x, x+ x1-1 n]. \] In particular this last observation makes both the Hoheisel and Heilbronn results fully explicit and effective. This (relatively) specific observation can be extended and generalized in various manners.
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.