Differences Between Consecutive Primes

Let p_n be the nth prime. Then this paper is concerned with provingthe following result on the distribution of consecutive primes. The exponent of x in this theorem improves on the work of Heath-Brownwho proved (1) with exponent . Under the Riemann hypothesisone can prove (1) with exponent .The proof of the theorem startswith the Heath-Brown–Linnik identity which leads to aformula giving the number of primes in an interval in termsof coefficients of certain Dirichlet series. I then estimatethe coefficients by using, among other things, the informationwhich can be gained from Montgomery's mean value theorem andHuxley's version of the Hal' asz lemma. Furthermore, by usingfamiliar sieve arguments I am able to discard some of the coefficientsallowing us to gain an improvement over the previous resultof Heath-Brown. 1991 Mathematics Subject Classification: 11N05.