A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Almost primes in almost all short intervals
Tekijät: Teravainen J
Kustantaja: CAMBRIDGE UNIV PRESS
Julkaisuvuosi: 2016
Journal: Mathematical Proceedings of the Cambridge Philosophical Society
Tietokannassa oleva lehden nimi: MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY
Lehden akronyymi: MATH PROC CAMBRIDGE
Vuosikerta: 161
Numero: 2
Aloitussivu: 247
Lopetussivu: 281
Sivujen määrä: 35
ISSN: 0305-0041
eISSN: 1469-8064
DOI: https://doi.org/10.1017/S0305004116000232(external)
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/17473466(external)
Let E-k be the set of positive integers having exactly k prime factors. We show that almost all intervals [x, x + log(1+epsilon) x] contain E-3 numbers, and almost all intervals [x, x + log(3.51) x] contain E-2 numbers. By this we mean that there are only 0(X) integers 1 <= x <= X for which the mentioned intervals do not contain such numbers. The result for E-3 numbers is optimal up to the epsilon in the exponent. The theorem on E-2 numbers improves a result of Harman, which had the exponent 7+epsilon in place of 3.51. We also consider general E-k numbers, and find them on intervals whose lengths approach log x as k -> infinity.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
