Related papers: Oscillations in Mertens Theorems and Other Finite …

Extending a classical estimate of Mertens for the sum of the reciprocals of the first primes, we provide an explicit remainder formula for products of an arbitrary, but fixed, number of primes.

We present a self-contained elementary and detailed exposition of Mertens' own proof of his theorem on the divergence of the series of the reciprocals of the primes and compare it with the modern proofs. His proof contains explicit…

Let $\sigma+i\gamma$ be a zero of the Riemann zeta function to the right of the line $\frac{1}{2}+it$. We show that this zero causes large oscillations of the error term of the prime number theorem. Our result is close to optimal both in…

We examine oscillations in a number of sums of arithmetic functions involving $\Omega(n)$, the total number of prime factors of $n$, and $\omega(n)$, the number of distinct prime factors of $n$. In particular, we examine oscillations in…

In this note we prove an inequality involving primes and the product of consecutive primes.

This article considers the error term of the primes counting function. It applies some recent results on the densities of prime numbers in short intervals to derive an improvement of the error term from subexponential size to fractional…

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

It is known that the sum of the reciprocal of integers, $\sum_n (1/n)$, and the sum of the reciprocal of primes, $\sum_n (1/p_n)$, both diverge. Here, we study a series made from primes that sums exactly to 1. We also show this sum is…

We derived the sum identities for generalized harmonic and corresponding oscillatory numbers for which a sieve procedure can be applied. The obtained results enable us to understand better the properties of these numbers and their…

In 1874, Mertens proved the approximate formula for partial Euler product for Riemann zeta function at $s=1$, which is called Mertens' theorem. In this paper, we generalize Mertens' theorem for Selberg class and show the prime number…

The aim of the paper is the proof of new identities for the constant in the Mertens product for arithmetic progressions. We deal with the problem of the numerical computation of these constants in another paper.

For $k\ge1$, 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)$, extending Mertens' second theorem, as well as a…

In a posteriori error analysis, the relationship between error and estimator is usually spoiled by so-called oscillation terms, which cannot be bounded by the error. In order to remedy, we devise a new approach where the oscillation has the…

For $k\ge1$, 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 for the reciprocal sum of $k$-almost primes. Our results match…

We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…

We give explicit numerical values with 100 decimal digits for the constant in the Mertens product over primes in the arithmetic progressions $a \bmod q$, for $q \in \{3$, ..., $100\}$ and $(a, q) = 1$.

We prove several results regarding the distribution of numbers that are the product of a prime and a $k$-th power. First, we prove an asymptotic formula for the counting function of such numbers; this generalises a result of E. Cohen. We…

In this paper we improve drastically the estimate for the multiplicity of a binary recurrence. The main contribution comes from an effective version of the Faltings' Product Theorem.

We show how to control the error term in Mertens' formula and related theorems in the context of additive arithmetical semigroups and carry over an old related result of Meissel.

We establish variation and oscillation inequalities for convolution products of probability measures on Z.