Related papers: Mertens' Proof of Mertens' Theorem

Myriad articles are devoted to Mertens's theorem. In yet another, we merely wish to draw attention to a proof by Hardy, which uses a Tauberian theorem of Landau that "leads to the conclusion in a direct and elegant manner". Hardy's proof is…

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.

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…

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…

Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…

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…

In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.

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,…

A proof of the continuous martingale convergence theorem is provided. It relies on a classical martingale inequality and the almost sure convergence of a uniformly bounded non-negative super-martingale, after a truncation argument.

In this paper, using the well known fact that the series of reciprocals of primes diverges, we obtain a general inequality for gaps of consecutive primes that holds for infinitely many primes. As it is shown the key ingredient for this…

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 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…

This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…

Two well known facts from elementary number theory are proven by using Bergman spaces.

Assuming the Generalized Riemann Hypothesis we obtain uniform, effective number-field analogues of Mertens' theorems.

Dirichlet's theorem on arithmetic progressions called as Dirichlet prime number theorem is a classical result in number theory. Atle Selberg\cite{Selberg} gave an elementary proof of this theorem. In this article we give an alternative…

We present a new, elementary, dynamical proof of the prime number theorem.

The Mertens' first theorem gives us the following asymptotic formula \begin{equation*} \sum_{\substack{p\leq x\\ p~prime}}\frac{lnp}{p}=lnx+O(1), \end{equation*} and the Mertens' second theorem indicates that there exists a constant…

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.