Midpoint approximation for jumps at prime powers

Let pnp_n be the nn-th prime, let l1l\geq1, and define the jump at pnlp_n^l by

Kn1(l)=li[ψ(pnl)]li[ψ(pnl1)].K_{n-1}^{(l)}=\operatorname{li}[\psi(p_n^l)]-\operatorname{li}[\psi(p_n^l-1)].

Prime-power midpoint conjecture. The jump satisfies

Kn1(l)=K~n1(l)+O(1/pn2l),K~n1(l)=logpnlog[(ψ(pnl)+ψ(pnl1))/2].K_{n-1}^{(l)}=\widetilde K_{n-1}^{(l)}+O(1/p_n^{2l}),\qquad \widetilde K_{n-1}^{(l)}=\frac{\log p_n}{\log\left[(\psi(p_n^l)+\psi(p_n^l-1))/2\right]}.

In particular, the sign of K~n1(l)1\widetilde K_{n-1}^{(l)}-1 is the sign of Kn1(l)1K_{n-1}^{(l)}-1. This is intended to approximate the jumps defining generalized Chebyshev primes.

Sources & referencesView supporting material

Primary source

Michel Planat and Patrick Solé, “Efficient prime counting and the Chebyshev primes”, arXiv:1109.6489 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.