A boundary value problem for a pair of differential delay equations related to sieve theory. II (Q1310894): Difference between revisions

[Part I, cf. Prog. Math. 85, 133--157 (1990; Zbl 0717.11036).] In [J. Number Theory 28, 306--346 (1988; Zbl 0639.10031)] the authors showed how to construct a sieve method of ``Buchstab iteration'' type, for which a putative main term had already been the subject of calculations by \textit{H. Iwaniec}, \textit{J. van de Lune} and \textit{H. J. J. te Riele} [Indagationes Math. 42, 409--417 (1980; Zbl 0445.10035)]. In this sieve method, iterative use of the identity of Buchstab in the style of Brun is combined with use of Selberg's \(\lambda^ 2\) upper bound method to produce upper and lower bound sieve theorems superior to those given by \textit{N. C. Ankeny} and \textit{H. Onishi} [Acta Arith. 10, 31--62 (1964; Zbl 0127.27002)], whose method may be viewed as a first iteration towards that used by the present authors. The authors' earlier paper depended upon an assertion, at that time unproved, concerning the behaviour of the difference-differential equations arising in their theorem. In the present paper a proof of this assertion is provided when the ``dimension'' \(\kappa\) of the sifting problem either exceeds 2 or takes the value \(3/2\). The proof uses numerical calculations carried out by F. S. Wheeler.