On the counting function of semiprimes

MaRDI QIDQ3390104zbMATH OpenFDO

Authors D. Crisan, Radek Erban

Publication date 24 March 2022

Full work available at URL https://arxiv.org/abs/2006.16491, http://math.colgate.edu/~integers/v122/v122.pdf

zbMATH Keywords

asymptotic behaviorsemiprimecounting function of semiprimes

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Arithmetic functions in probabilistic number theory (11K65) Distribution of integers with specified multiplicative constraints (11N25) Evaluation of number-theoretic constants (11Y60)

Abstract: A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $p{i}_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument, asymptotic series of $p{i}_2(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.

Recommendations

• On distribution of semiprime numbers
• Higher Mertens constants for almost primes
• Asymptotic distribution of integers with certain prime factorizations
• scientific article; zbMATH DE number 4068999
• The prime-counting function and its analytic approximations. \(\pi(x)\) and its approximations

Cites work

• scientific article; zbMATH DE number 3134390 (Why is no real title available?)
• scientific article; zbMATH DE number 3700957 (Why is no real title available?)
• scientific article; zbMATH DE number 473229 (Why is no real title available?)
• Approximate formulas for some functions of prime numbers
• Explicit estimates of some functions over primes
• Extension of the Riemann ξ-Function's Logarithmic Derivative Positivity Region to Near the Critical Strip
• New bounds for the prime counting function
• On a family of functions defined over sums of primes
• On a theorem of Erdös-Kac
• On distribution of semiprime numbers
• On the prime zeta function
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• Sur des formules de Atle Selberg
• Sur la distribution des nombres entiers ayant une quantité fixée de facteurs premiers
• The Stieltjes Function--Definition and Properties
• Two new proofs of the Erdös–Kac Theorem, with bound on the rate of convergence, by Stein's method for distributional approximations
• Updating the error term in the prime number theorem

Cited in

(3)

• Higher Mertens constants for almost primes. II.
• Random ordering of semiprimes
• On a constant related to the prime counting function

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)