Some numerical results in the Selberg sieve method (Q5618436)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3342076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some numerical results in the Selberg sieve method |
scientific article; zbMATH DE number 3342076 |
Statements
Some numerical results in the Selberg sieve method (English)
0 references
1972
0 references
0.7700769901275635
0 references
0.7651652097702026
0 references
For each \(k>0\), let \(\sigma_k(u)\) denote the (continuous) solution of the differential-difference equation \[ (u^{-k}\sigma_k(u))' = ku^{-k-1}\sigma_k(u-2),\quad (u\ge 2) \] \[ \sigma_k(u) = \frac{2^{-k}e^{-\gamma k}}{\Gamma(k+1)} u^k,\quad (0\le u <2), \] where \(\gamma\) is Euler's constant. Further, let \(\nu_k\) denote the (unique, positive) solution of \[ kx^{-k} \int_x^\infty t^{k-1} \left(\frac{1}{\sigma_k(t-1)} -1\right)\,dt =1. \] \textit{N. C. Ankeny} and \(H. Onishi\) [Acta Arith. 10, 31--62 (1964; Zbl 0127.27002)] have shown the importance of the \(\sigma_k\)-functions and the parameters \(\nu_k\) in the lower-bound Selberg sieve method. In this paper tables are given of \(\sigma_2(u)\) for \(0 <u\le 10\) (correcting and extending the table of Ankeny and Onishi's results). Various consequences of these calculations are also given, of which the following is a typical example: There are infinitely many primes \(p\) such that \((p+2)(p+6)\) is the product of at most 7 prime factors.
0 references