Differences Between Consecutive Primes (Q4354313)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1060868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Differences Between Consecutive Primes |
scientific article; zbMATH DE number 1060868 |
Statements
Differences Between Consecutive Primes (English)
0 references
16 September 1997
0 references
sieve methods
0 references
distribution of consecutive primes
0 references
Dirichlet series
0 references
0.854258120059967
0 references
0.8493030667304993
0 references
0.8474476337432861
0 references
Let \(p_n\) be the \(n\)-th prime. This paper is concerned with proving the following result on the distribution of consecutive primes. Theorem. \[ \sum_{p_{n+1}-p_n> x^{\frac12}, p_n\leq x}p_{n+1}-p_n\;\ll\;x^{\frac{25}{36}+ \varepsilon}. \tag{1} \] The exponent of \(x\) in this theorem improves on the work of Heath-Brown who proved (1) with exponent \(\frac34\). On the Riemann hypothesis one can prove (1) with exponent \(\frac12\). The proof of the theorem starts off with the Heath-Brown--Linnik identity, which leads to a formula giving the number of primes in an interval in terms of coefficients of certain Dirichlet series. The author then estimates the coefficients by using among other things the information which can be gained from Montgomery's mean value theorem and Huxley's version of the Halász lemma. Furthermore by using familiar sieve arguments he is able to discard some of the coefficients, allowing an improvement over the previous result of Heath-Brown.
0 references