The Difference Between Consecutive Primes, II

2001/11/01 by R. C. Baker, Roger C. Baker, G. Harman +1 · 24 citations
Mathematics · #Analytic Number Theory Research

paper · doi:10.1112/plms/83.3.532

Abstract

The authors sharpen a result of Baker and Harman (1995), showing that [x, x + x0.525] contains prime numbers for large x. An important step in the proof is the application of a theorem of Watt (1995) on a mean value containing the fourth power of the zeta function. 2000 Mathematical Subject Classification: 11N05.

Citations

• The Difference Between Consecutive Primes
• Prime Numbers in Short Intervals and a Generalized Vaughan Identity

Cited by

• Weakening the Legendre Conjecture
• Randomised algebraic constructions for the no-(k+1)-in-line problem
• On Hales-Jewett and Related Numbers
• Conjectural Decidability of the Skolem Problem
• Short intervals for the Romanoff-type sumset
• Covering in Hamming and Grassmann Spaces: New Bounds and Reed--Solomon-Based Constructions
• Almost primes between all squares
• How often are \lfloor n^α \rfloor and \lfloor n^β \rfloor simultaneously primes?
• An explicit result for primes between cubes
• On the distribution of very short character sums
• Describe Prime number gaps pattern by Logistic mapping
• Periodic Points of Hamiltonian Diffeomorphisms Equal to Nondegenerate Linear Maps at Infinity
• Network-Coding Solutions for Minimal Combination Networks and Their Sub-networks
• On Legendre's, Brocard's, Andrica's, and Oppermann's Conjectures
• The Davenport constant of balls and boxes
• On the Maximal Gap between Primes
• An inverse theorem on sets with rich additive structure modulo primes
• Conjectures About Cyclic Numbers: Resolutions and Counterexamples
• Transcendency of variants of Mills' constant
• Constructing elliptic curves in almost polynomial time
• Effective short intervals containing primes
• List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
• A robust family of residually finite groups; spectra of residual finiteness growth, computability properties, and other applications (with an appendix by Arman Darbinyan and Emmanuel Rauzy)
• On Optimal Locally Repairable Codes with Super-Linear Length

Related

• On the Difference between Consecutive Primes and Estimates of the Number of Primes in the Interval (n, 2n)
• Large gaps between consecutive prime numbers containing square-free numbers and perfect powers of prime numbers
• Primes in almost all short intervals
• The number of primes in short intervals and numerical calculations for Harman's sieve
• A Simple Proof Of The Prime Number Theorem