English

Prime Running Functions

Number Theory 2020-06-25 v1

Abstract

We study arithmetic functions Φ(x;d,a)\Phi(x;d,a), called prime running functions, whose value at xx sums the gaps between primes pka (mod d)p_k \equiv a\ (\text{mod}\ d) below xx and the next following prime pk+1p_{k+1}, up to xx. (The following prime pk+1p_{k+1} may be in any residue class (mod d)(\text{mod}\ d).) We empirically observe systematic biases of order x/logxx / \log x in Φ(x;d,a)Φ(x;d,b)\Phi(x;d,a) - \Phi(x;d,b) for different a,ba,b. We formulate modified Cram\'er 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\'er models are compared with the experimental data.

Keywords

Cite

@article{arxiv.2006.13355,
  title  = {Prime Running Functions},
  author = {Jaeyoon Kim},
  journal= {arXiv preprint arXiv:2006.13355},
  year   = {2020}
}

Comments

Accepted by Experimental Mathematics (06-21-2020)

R2 v1 2026-06-23T16:34:21.360Z