The differences between consecutive almost-primes (Q1103670): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.21099/tkbjm/1496160579 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1602907232 / rank
 
Normal rank

Latest revision as of 01:18, 20 March 2024

scientific article
Language Label Description Also known as
English
The differences between consecutive almost-primes
scientific article

    Statements

    The differences between consecutive almost-primes (English)
    0 references
    0 references
    1987
    0 references
    Let \(d_ n=P_{2,n+1}-P_{2,n}\) denote the difference between consecutive \(P_ 2\) numbers, that are defined as having at most two prime factors, and consider the sum \(D_ 2(x)=\sum d\) \(2_ n\) summed over those n for which \(P_{2,n}\leq x\). Using analytic methods, \textit{U. Meyer} showed [Arch. Math. 42, 448-454 (1984; Zbl 0524.10036)] that \(D_ 2(x)\ll x^{1.285} \log^{10}x.\) The author shows \(D_ 2(x)\ll x^{1.023},\) using a form of the weighted sieve involving Selberg's \(\lambda\) 2-method obtained by the reviewer [Acta Arith. 47, 71-96 (1986; Zbl 0549.10036)].
    0 references
    0 references
    difference between consecutive \(P_ 2\) numbers
    0 references
    weighted sieve
    0 references
    0 references