Related papers: A Simple Proof Of The Prime Number Theorem

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…

From Bombieri's mean value theorem one can deduce the prime number theorem being equivalent to the Riemann hypothesis and the least prime P(q) satisfying P(q)= O(q^2 [ln q]^32) in any arithmetic progressions with common difference q.

Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…

Assuming the Generalized Riemann Hypothesis (GRH), we show using the asymptotic large sieve that 91% of the zeros of primitive Dirichlet $L$-functions are simple. This improves on earlier work of \"{O}zl\"{u}k which gives a proportion of at…

In this expository article we provide an elegant proof of the one-sided Ingham-Karamata Tauberian theorem. As an application, we present a short deduction of the prime number theorem.

The class of Dirichlet series associated with a periodic arithmetical function $f$ includes the Riemann zeta-function as well as Dirichlet $L$-functions to residue class characters. We study the value-distribution of these Dirichlet series…

A new method for continuing the usual Dirichlet series that defines the Riemann zeta function ${\zeta}(s)$ is presented. Numerical experiments demonstrating the computational efficacy of the resulting continuation are discussed.

We define reduced zeta functions of Lie algebras, which can be derived from motivic zeta functions using the Euler characteristic. We show that reduced zeta functions of Lie algebras possessing a suitably well-behaved basis are easy to…

In the present paper the asymptotic formulae for the first moment of the Riemann zeta-function on the critical line is proven under assumption of the Riemann Hypothesis.

Improving earlier work of Balasubramanian, Conrey and Heath-Brown, we obtain an asymptotic formula for the mean-square of the Riemann zeta-function times an arbitrary Dirichlet polynomial of length $T^{1/2 + \delta}$, with $\delta =…

Let $d(n)$ be the Dirichlet divisor function and $\Delta(x)$ denote the error term of the sum $\sum_{n\leqslant x}d(n)$ for a large real variable $x$. In this paper we focus on the sum $\sum_{p\leqslant x}\Delta^2(p)$, where $p$ runs over…

We give an account of the arguments that lead from the assumption of the existence of exceptional characters to the asymptotics in related ranges for the counting function of twin primes.

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…

Let v be a multiplicative arithmetic function with support of positive asymptotic density. We prove that for any not identically zero arithmetic function f such that \sum_{f(n) \neq 0} 1 / n < \infty, the support of the Dirichlet…

In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: $$ \pi(x)=\operatorname{li}(x)+\mathcal O(xe^{-c\sqrt{\log x}}) $$ Instead of performing asymptotic expansion on Chebyshev…

Hal\'asz's Theorem gives an upper bound for the mean value of a multiplicative function $f$. The bound is sharp for general such $f$, and, in particular, it implies that a multiplicative function with $|f(n)|\le 1$ has either mean value…

A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…

We improve existing estimates of moments of the Riemann zeta function. As a consequence, we are able to derive new estimates for the asymptotic behaviour of $\sum_{N \alpha \le x} \mathfrak{t}_k(\alpha)$, where $N$ stands for the norm of a…

Motivated by a probabilistic analysis of a simple game (itself inspired by a problem in computational learning theory) we introduce the \emph{moment zeta function} of a probability distribution, and study in depth some asymptotic properties…