Very large gaps between consecutive primes
Let \(G(x)=\max p_{n+1}-p_n\) for primes \(p_n\leq x\). Then it is shown that \[ G(x)\geq (2e^\gamma+o(1)) \frac{(\log x)(\log\log x)(\log\log\log\log x)}{(\log \log\log x)^2}. \] This improves results of \textit{R. A. Rankin} [Proc. Edinb. Math. Soc., II. Ser. 13, 331-332 (1963; Zbl 0121.04705)] (with constant \(e^\gamma\)) and \textit{H. Maier} and \textit{C. Pomerance} [Trans. Am. Math. Soc. 322, 201-237 (1990; Zbl 0706.11052)] (with constant \((1.312\dots)e^\gamma)\). In both these papers one arrives at a set \(R\) of integers that must be covered by congruences \(a_p\pmod p\) for suitable primes \(p\). The numbers \(a_p\) are free to be chosen. Rankin essentially uses each prime \(p\) to cover one element of \(R\). Maier and Pomerance show that one can often delete two elements of \(R\) with the same prime \(p\). The present paper shows that one can almost always delete two elements of \(R\) for each prime. The result and its proof are phrased in terms of colourings of graphs. The existence of a suitable colouring is established by a probabilistic argument.
- Landau's problems on primes
- Chains of large gaps between consecutive primes
- Domination and upper domination of direct product graphs
- Erdős and the integers
- Universality and distribution of zeros and poles of some zeta functions
- On the gaps between consecutive primes
- Domination in direct products of complete graphs
- The ternary Goldbach problem with a prime and two isolated primes
- Long gaps in sieved sets
- Large gaps between consecutive prime numbers containing perfect powers
- On the Ratio of Consecutive Gaps Between Primes
- A note on the theorem of Maynard and Tao
- Disproof of a conjecture of Jacobsthal
- Large gaps between primes
- Large gaps between consecutive prime numbers
- Computation of Jacobsthal's function \(h(n)\) for \(n<50\).
- Long gaps between deficient numbers
- Chains of Large Gaps Between Primes
- Unusually Large Gaps Between Consecutive Primes
- A remark on the geometry of spaces of functions with prime frequencies
- Long gaps between primes
- Large gaps between consecutive prime numbers containing perfect k-th powers of prime numbers
- An upper bound on Jacobsthal's function
- Dirichlet's theorem and Jacobsthal's function
- On intervals with few prime numbers
- Sums of two squares in short intervals
- Primes in tuples. II
- The sequence of prime gaps is graphic
- Different approaches to the distribution of primes
- Prime avoiding numbers form a basis of order 2
- An explicit lower bound for large gaps between some consecutive primes
This page was built for publication: Very large gaps between consecutive primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355089)
