• Corpus ID: 119174212

On the difference between consecutive primes

@article{Maynard2012OnTD,
title={On the difference between consecutive primes},
author={James Maynard},
journal={arXiv: Number Theory},
year={2012}
}
• J. Maynard
• Published 9 January 2012
• Mathematics
• arXiv: Number Theory
Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of differences between consecutive primes $\sum_{p_n\le x}(p_{n+1}-p_n)^2$ is bounded by $x^{5/4+{\epsilon}}$ for $x$ sufficiently large and any fixed ${\epsilon}>0$. The proof relies on utilising various mean-value estimates for Dirichlet polynomials.
303 Citations

Averaged Form of the Hardy-Littlewood Conjecture

We study the prime pair counting functions $\pi_{2k}(x),$ and their averages over $2k.$ We show that good results can be achieved with relatively little effort by considering averages. We prove an

References

SHOWING 1-10 OF 33 REFERENCES

On the difference between consecutive primes

[Received 3 August 1937] 1. LET pn denote the nth. prime, and 77(2;) the number of primes p not exceeding x. The existence of an absolute constant 6 < 1 such that a (1) n(x) ~ . log a; when x -> 00,

The Differences Between Consecutive Primes

This paper discusses two problems which relate to the difference between consecu~ve primes. Let p. be the nth prime, and d. = p . + l p . . (1) We want to find a funct ion f(,~) such that d . 0 is a

The difference of consecutive primes

is greater than (c2/2)n. A simple calculation now shows that the primes satisfying (4) also satisfy the first inequality of (3) iÎ€ = e(ci) is chosen small enough. The second inequality of (3) is

The Difference between Consecutive Prime Numbers V

• R. Rankin
• Mathematics
Proceedings of the Edinburgh Mathematical Society
• 1963
Let pn denote the nth prime and let ε be any positive number. In 1938 (3) Ishowed that, for an infinity of values of n, where, for k≧1, logk+1x = log (logk x) and log1x = log x. In a recent paper (4)

The number of primes in a short interval.

which estimates the number of primes in the interval (x —y, x]. According to the Prime Number Theorem, the above estimate holds uniformly for cx^y^x, if c is any positive constant. Much work has been

On the difference between consecutive prime numbers

/ = lim inf ̂ 11-tl . »->» log pn The purpose of this paper is to combine the methods used in two earlier papers1 in order to prove the following theorem. Theorem. (1) / = c(l + 40)/5, where c<

Very Large Gaps between Consecutive Primes

Abstract LetG(X) denote the largest gap between consecutive primes belowX. Improving earlier results of Erdős, Rankin, Schonhage, and Maier-Pomerance, we prove G(X)⩾(2e γ +o(1)) log Xlog 2 Xlog 4

Prime Numbers in Short Intervals and a Generalized Vaughan Identity

1. Introduction. Many problems involving prime numbers depend on estimating sums of the form ΣΛ(n)f(n), for appropriate functions f(n), (here, as usual, Λ(n) is the von Mangoldt function). Three

On maximal gaps between successive primes

exists and perhaps it might be possible to determine its value, but it will probably not be possible to express ft(n) by a simple function of n and t (even for t = 3). If t is large compared to n our

HARALD CRAM ER AND THE DISTRIBUTION OF PRIME NUMBERS

er. We shall see how their legacy has inuenced research for most of the rest of the century, particularly through the 'schools' of Selberg, and of Erdos, and with the \large sieve" in the sixties.