Jonathan Bayless

activity

20102023

most citedHigher Mertens constants for almost primes

5 citations · 5 across the 2 of their papers we have counts for

collaborators

3 papers

math.NT2023

Higher Mertens constants for almost primes II

Jonathan Bayless, Paul Kinlaw, Jared Duker Lichtman

For $k \geq 1$ , let $R_{k} (x)$ denote the reciprocal sum up to $x$ of numbers with $k$ prime factors, counted with multiplicity. In prior work, the authors obtained estimates for $R_k(x…

math.NT2021★ 5 cited

Higher Mertens constants for almost primes

Jonathan Bayless, Paul Kinlaw, Jared Duker Lichtman

For $k \geq 1$ , a $k$ -almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics fo…

math.NT2010

On the Sum of Reciprocals of Amicable Numbers

Jonathan Bayless, Dominic Klyve

Two numbers $m$ and $n$ are considered amicable if the sum of their proper divisors, $s (n)$ and $s (m)$ , satisfy $s (n) = m$ and $s (m) = n$ . In 1981, Pomerance showed that the sum of…