On the counting function of semiprimes

From MaRDI portal
Publication:3390104

zbMATH Open1501.11093arXiv2006.16491MaRDI QIDQ3390104FDOQ3390104


Authors: D. Crisan, Radek Erban Edit this on Wikidata


Publication date: 24 March 2022

Abstract: A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function pi2(x), the number of semiprimes less than or equal to x, is studied. Using a combinatorial argument, asymptotic series of pi2(x) is determined, with all the terms explicitly given. An algorithm for the calculation of the constants involved in the asymptotic series is presented and the constants are computed to 20 significant digits. The errors of the partial sums of the asymptotic series are investigated. A generalization of this approach to products of k primes, for kgeq3, is also proposed.


Full work available at URL: https://arxiv.org/abs/2006.16491




Recommendations




Cites Work


Cited In (3)





This page was built for publication: On the counting function of semiprimes

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