2000 character limit reached
Some heuristics on the gaps between consecutive primes
Published 2 Feb 2011 in math.NT | (1102.0481v3)
Abstract: We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\pi(x)$. As the application of this formula we formulate 7 conjectures, among others for the maximal gap between two consecutive primes smaller than $x$, for the generalized Brun's constants and the first occurrence of a given gap $d$. Also the leading term $\log \log(x)$ in the prime harmonic sum is reproduced from our guesses correctly. These conjectures are supported by the computer data.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.