Almost‐prime k ‐tuples

From MaRDI portal
Publication:4354289





Let \(L_1(n),\dots, L_k(n)\) be linear functions satisfying the conditions for the prime \(k\)-tuples conjecture. Then it is shown that there are \(\gg x(\log x)^{-k}\) integers \(n\leq x\), such that the \(L_i(n)\) are square-free and coprime in pairs, and \[ \sum_{i=1}^k \tau(L_i(n))\leq \Biggl[\frac{k(3k+8)}2\Biggr], \] where \(\tau\) is the usual divisor function. In particular one has \[ \omega(L_i(n))\leq R_k\sim \frac{2\log k}{\log 2} \] simultaneously for \(1\leq i\leq k\), for such \(n\). Here \(R_2=3\), \(R_3=4\), \(R_4=R_5=5\), and \(R_6=R_7=R_8=6\), for example. As a by-product the theorem also implies that \(\prod L_i(n)\) is a \(P_r\) number, with \(r=r_k\sim k\log k/\log 2\) and \(r_2=5\), \(r_3=9\), \(r_4=13\), \(r_5=17\), \(r_6=21\), \(r_7=26\), \(r_8=32\), for example. These results are better than those given in \textit{H. Halbertsam} and \textit{H.-E. Richert} [Sieve methods (Academic Press, London, 1974; Zbl 0298.10026)], but not as sharp as the bounds recently obtained by \textit{H. G. Diamond} and \textit{H. Halberstam} [Sieve methods, exponential sums, and their applications in number theory, Lond. Math. Soc., Lect. Notes 237, 101-107 (Cambridge University Press, 1997; Zbl 0941.11034)]. The proof generalizes a method of \textit{A. Selberg} [Collected papers, Vol. II (Springer, Berlin, 1991; Zbl 0729.11001)], who investigated the case \(k=2\). One considers \[ \sum_{n\leq x}\Biggl\{1- \rho\sum_{i=1}^k \tau(L_i(n)) \Biggr\}\Bigl({}_{d\mid\prod L_i(n)} \lambda_d\Bigr)^2 \] for a suitable positive constant \(\rho\) and obtains a positive value by choosing the numbers \(\lambda_d\) as in the Selberg sieve. The result then follows. In contrast to previous weighted lower bound sieves, no numerical integrations are required.











This page was built for publication: Almost‐prime k ‐tuples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354289)