arXiv · 2006.13355
Prime Running Functions
Abstract
We study arithmetic functions $Φ(x;d,a)$, called prime running functions, whose value at $x$ sums the gaps between primes $p_k \equiv a\ (\text{mod}\ d)$ below $x$ and the next following prime $p_{k+1}$, up to $x$. (The following prime $p_{k+1}$ may be in any residue class $(\text{mod}\ d)$.) We empirically observe systematic biases of order $x / \log x$ in $Φ(x;d,a) - Φ(x;d,b)$ for different $a,b$. We formulate modified Cramér models for primes and show that the corresponding sum of prime gap statistics exhibits systematic biases of this order of magnitude. The predictions of such modified Cramér models are compared with the experimental data.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jaeyoon Kim. 2020-06-23. Prime Running Functions. https://doi.org/10.1080/10586458.2020.1786863
Cite the original work for its findings. Save a collection to share your selection of sources.