Related papers: Mertens's theorem for splitting primes and more

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

We provide several general versions of Littlewood's Tauberian theorem. These versions are applicable to Laplace transforms of Schwartz distributions. We apply these Tauberian results to deduce a number of Tauberian theorems for power series…

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…

Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…

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…

We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many…

The article presents a generalization of the classical Hardy-Littlewood conjecture concerning the density of prime tuples to the case of tuples consisting of almost-prime numbers (numbers with a specified quantity of prime divisors). The…

We give new characterizations of the Midy's property and using these results we obtain a new proof of a special case of the Dirichlet's theorem about primes in arithmetic progression.

Let $u(x)$ be a subpolynomial function in a Hardy field. We establish necessary and sufficient conditions for the weighted uniform distribution of the sequences $(u(n))_{n\in\mathbb{N}}$ and $(u(p_n))_{n\in\mathbb{N}}$, where $p_n$ denotes…

This paper demonstrates that from the Cramer's, Hardy-Littlewood's and Bateman-Horn's conjectures (suggest that the probability of a large positive integer being $x$ a prime - $\frac {1} {\ln(x)}$) it follows that the events consisting in a…

In a recent paper [e-print quant-ph/0101012], Hardy has given a derivation of "quantum theory from five reasonable axioms." Here we show that Hardy's first axiom, which identifies probability with limiting frequency in an ensemble, is not…

In this note we examine Littlewood's proof of the prime number theorem. We show that this can be extended to provide an equivalence between the prime number theorem and the non-vanishing of Riemann's zeta-function on the one-line. Our…

We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…

We show that Hardy's uncertainty principle can be reformulated in such a way that it has an analogue even for compact Lie groups and symmetric spaces of compact type.

We give a new proof of a theorem of B.M. Bredihin which was originally proved by extending Linnik's solution, via his dispersion method, of a problem of Hardy and Littlewood.

A celebrated theorem of Delange gives a sufficient condition for an arithmetic function to be the sum of the associated Ramanujan expansion with the coefficients provided by a previous result of Wintner. By applying the Delange theorem to…

The Taylor expansion is a widely used and powerful tool in all branches of Mathematics, both pure and applied. In Probability and Mathematical Statistics, however, a stronger version of Taylor's classical theorem is often needed, but only…

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…

In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…

The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…