English
Related papers

Related papers: Generalized Mertens sums

200 papers

Assuming the validity of Riemann Hypothesis (RH), we derive the explicit bilateral estimates ("narrow passage") of the remainder in the modified Mertens asymptotic formula for the sums of primes' reciprocals. These results are reversable,…

Number Theory · Mathematics 2022-05-13 Gennadiy Kalyabin

This note simplifies the proof of a recent result on the oscillation of the prime product in Martens Theorem, and provides a quantitative expression for the error term. In addition, the corresponding oscillation results for the finite sums…

Number Theory · Mathematics 2013-07-11 N. A. Carella

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…

History and Overview · Mathematics 2007-05-23 Mark B. Villarino

A highly strong upper estimate in the modified asymptotic formula for sums of the primes' reciprocals is proved to be necessary (as well as sufficient) in order the Ramanujan inequality holds true. Some other criteria in similar terms are…

Number Theory · Mathematics 2022-01-11 Gennadiy Kalyabin

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…

Number Theory · Mathematics 2023-03-14 Jonathan Bayless , Paul Kinlaw , Jared Duker Lichtman

In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.

History and Overview · Mathematics 2023-03-20 Jean-Christophe Pain

We consider the sum of the reciprocals of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an asymptotic expansion in the first case and an asymptotic formula involving an implicit parameter in the…

Number Theory · Mathematics 2025-07-04 Jonathan Rotgé

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…

Number Theory · Mathematics 2025-12-09 Zhen Chen , Junrong Luo

In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.

Number Theory · Mathematics 2017-12-21 Fouad Bounebirat , Diffalah Laissaoui , Mourad Rahmani

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…

Number Theory · Mathematics 2021-08-10 Ken Hicks , Kevin Ward

In 1874, Mertens famously proved an asymptotic formula for the product $p/(p-1)$ over all primes $p$ up to $x$. On the other hand, one may expand Mertens' prime product into series over numbers $n$ with only small prime factors. It is…

Number Theory · Mathematics 2021-08-31 Jared Duker Lichtman

Explicit formulas involving a generalized Ramanujan sum are derived. An analogue of the prime number theorem is obtained and equivalences of the Riemann hypothesis are shown. Finally, explicit formulas of Bartz are generalized.

Number Theory · Mathematics 2015-04-02 Patrick Kühn , Nicolas Robles

We generalize Mertens' product theorem to Chebotarev sets of prime ideals in Galois extensions of number fields. Using work of Rosen, we extend an argument of Williams from cyclotomic extensions to this more general case. Additionally, we…

Number Theory · Mathematics 2025-09-17 Santiago Arango-Piñeros , Daniel Keliher , Christopher Keyes

Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors…

Number Theory · Mathematics 2012-12-27 Alessandro Languasco , Alessandro Zaccagnini

We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.

General Mathematics · Mathematics 2017-08-25 Michael J. Caola

The main result is a generalization of Keller's recursion equation for finding a prime number given the previous primes. We also examine the convergence of the limit in Keller's equation and the convergence of the limit in the general…

Number Theory · Mathematics 2013-11-19 James Haley

We present a variety of prime-generating constructions that are based on sums of primes. The constructions come in all shapes and sizes, varying in the number of dimensions and number of generated primes. Our best result is a construction…

History and Overview · Mathematics 2017-03-28 Dmitry Kamenetsky

A 1976 result from Norton may be used to give an asymptotic (but not explicit) description of the constant in Mertens' second theorem for primes in arithmetic progressions. Assuming the Generalized Riemann Hypothesis, we give an effective…

Number Theory · Mathematics 2024-05-27 Daniel Keliher , Ethan Simpson Lee

In this note, we extend to a composite modulo a recent result of Chan (2016) dealing with mean values of the product of an integer and its multiplicative inverse modulo a prime number.

Number Theory · Mathematics 2023-04-11 Olivier Bordellès , László Tóth

We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.

Number Theory · Mathematics 2010-03-03 Vladimir Shevelev
‹ Prev 1 2 3 10 Next ›