English

Higher Mertens constants for almost primes

Number Theory 2022-01-31 v3 Combinatorics

Abstract

For k1k\ge1, a kk-almost prime is a positive integer with exactly kk prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of kk-almost primes. Our results match the strength of those of classical analytic methods. We also study the limiting behavior of the constants appearing in these estimates, which may be viewed as higher analogues of the Mertens constant β=0.2614...\beta=0.2614... Further, in the case k=2k=2 of semiprimes we give yet finer-scale and explicit estimates, as well as a conjecture.

Keywords

Cite

@article{arxiv.2103.09866,
  title  = {Higher Mertens constants for almost primes},
  author = {Jonathan Bayless and Paul Kinlaw and Jared Duker Lichtman},
  journal= {arXiv preprint arXiv:2103.09866},
  year   = {2022}
}

Comments

24 pages; minor corrections

R2 v1 2026-06-24T00:17:22.133Z