Preprint in the OpenAI Math release
Positive lower density of large prime gaps
OpenAI
Abstract
For every fixed C > 0, we prove that a positive proportion of consecutive prime gaps exceed , where p is the smaller prime. The proportion is bounded below for every sufficiently large initial segment of the prime sequence, with a constant depending on C. It follows that the indices at which increases have positive lower asymptotic density, answering a question of Erdős and Prachar.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.