Wolf's sign-change conjecture for the twin-prime counting error

Let P2=(p,p+2)P_2=(p,p+2) be the twin-prime tuple, let π2(n)\pi_2(n) count primes pnp\leq n such that p+2p+2 is prime, and let C2C_2 be the twin-prime constant. Define

d2(n)=π2(n)C2Li2(n),Li2(n)=2ndtlog2t.d_2(n)=\pi_2(n)-C_2\operatorname{Li}_2(n),\qquad \operatorname{Li}_2(n)=\int_2^n\frac{dt}{\log^2 t}.

Wolf's conjecture. The number of sign changes of d2(n)d_2(n) for n(1,T)n\in(1,T) is TlogT\frac{\sqrt T}{\log T}. This numerical prediction concerns fluctuations around the Hardy–Littlewood estimate; the paper reports substantial computational evidence, but no proof or resolution is given.

Sources & referencesView supporting material

Primary source

László Tóth, “On The Asymptotic Density Of Prime k-tuples and a Conjecture of Hardy and Littlewood”, arXiv:1910.02636 (2019).

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.