Über das Primzahl-Zwillingsproblem. (On the twin-prime problem) (Q1103669): Difference between revisions

It is shown that for `almost all' numbers \(k\leq x\) and all \(y\in [2x,x^{8/5-\epsilon}]\) the number of prime pairs \(\leq y\) with difference 2k is asymptotically equal to the expression conjectured by Hardy-Littlewood. This improves earlier results of van der Corput and Lavrik.