No CrossRef data available.
Published online by Cambridge University Press: 26 February 2010
§1. Let pi denote the i-th prime number, and let

The prime number theorem implies Er ≤ r. Bombieri and Davenport [1] showed that

improving earlier results of Erdős, Rankin and Ricci. Their basic result (corresponding to Lemma 1 below) counts pairs of primes differing by 2n with some weight t(n).