Indexed metadata

Average prime-pair counting formula

Jaap Korevaar, Herman te Riele

Source record

Source: Crossref

Published: Sep 25, 2009

DOI: 10.1090/s0025-5718-09-02312-6

Open original source ↗

Source abstract

Taking r > 0 r>0 , let π 2 r ( x ) \pi _{2r}(x) denote the number of prime pairs ( p , p + 2 r ) (p,\,p+2r) with p ≤ x p\le x . The prime-pair conjecture of Hardy and Littlewood (1923) asserts that π 2 r ( x ) ∼ 2 C 2 r l i 2 ( x ) \pi _{2r}(x)\sim 2C_{2r}\,\mathrm {li}_2(x) with an explicit constant C 2 r > 0 C_{2r}>0 . There seems to be no good conjecture for the remainders ω 2 r ( x ) = π 2 r ( x ) − 2 C 2 r l i 2 ( x ) \omega _{2r}(x)=\pi _{2r}(x)- 2C_{2r}\,\mathrm {li}_2(x) that corresponds to Riemann’s formula for π ( x ) − l i ( x ) \pi (x)-\mathrm {li}(x) . However, there is a heuristic approximate formula for averages of the remainders ω 2 r ( x ) \omega _{2r}(x) which is supported by numerical results.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Average prime-pair counting formula — Mathematical Frontier Network