Montgomery's weighted sieve for dimension two

The most well-known application of Montgomery's weighted sieve is to the so-called Brun-Titchmarsh inequality, which was proved byH. L. Montgomery andR. C. Vaughan in the form (x, k, l)2x((k)log(x/k))^–1 for 1k<x, (k, l)=1, (x, k, l) being the number of primespx andpl modk, (k) being Euler's function. In this paper an upper estimate is given for a certain class of two-dimensional sieve problems, among them bounds for the number of twin primes and the number of Goldbach representations.